./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.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.ufo.UNBOUNDED.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 f95bc0400f9e54d231740d68b8f60687442b1216917c3afc522bda656e30c0ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:55:10,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:55:10,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:55:10,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:55:10,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:55:10,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:55:10,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:55:10,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:55:10,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:55:10,200 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:55:10,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:55:10,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:55:10,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:55:10,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:55:10,202 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:55:10,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:55:10,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:55:10,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:55:10,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:55:10,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:55:10,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:55:10,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:55:10,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:55:10,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:55:10,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:55:10,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:55:10,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:55:10,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:55:10,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:55:10,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:55:10,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:55:10,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:55:10,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:55:10,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:55:10,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:55:10,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:55:10,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:55:10,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:55:10,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:55:10,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:55:10,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:55:10,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:55:10,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:55:10,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:55:10,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:55:10,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:55:10,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:55:10,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:55:10,207 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 -> f95bc0400f9e54d231740d68b8f60687442b1216917c3afc522bda656e30c0ed [2025-01-09 05:55:10,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:55:10,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:55:10,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:55:10,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:55:10,526 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:55:10,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:55:11,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc005c6b7/25bf5423c47c4c40a2951c14032c3ac6/FLAGa12ab1dea [2025-01-09 05:55:12,600 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:55:12,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:55:12,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc005c6b7/25bf5423c47c4c40a2951c14032c3ac6/FLAGa12ab1dea [2025-01-09 05:55:12,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc005c6b7/25bf5423c47c4c40a2951c14032c3ac6 [2025-01-09 05:55:12,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:55:12,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:55:12,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:55:12,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:55:12,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:55:12,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:55:12" (1/1) ... [2025-01-09 05:55:12,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da0e4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:12, skipping insertion in model container [2025-01-09 05:55:12,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:55:12" (1/1) ... [2025-01-09 05:55:12,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:55:13,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c[15510,15523] [2025-01-09 05:55:13,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c[22446,22459] [2025-01-09 05:55:13,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:55:13,822 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:55:13,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c[15510,15523] [2025-01-09 05:55:13,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c[22446,22459] [2025-01-09 05:55:14,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:55:14,227 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:55:14,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14 WrapperNode [2025-01-09 05:55:14,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:55:14,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:55:14,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:55:14,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:55:14,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:14,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:14,669 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5151 [2025-01-09 05:55:14,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:55:14,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:55:14,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:55:14,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:55:14,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:14,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:14,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:14,889 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:55:14,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:14,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:14,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:15,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:15,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:15,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:15,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:15,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:55:15,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:55:15,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:55:15,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:55:15,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (1/1) ... [2025-01-09 05:55:15,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:55:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:15,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:55:15,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:55:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:55:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:55:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:55:15,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:55:15,387 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:55:15,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:55:20,146 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-01-09 05:55:20,147 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:55:20,182 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:55:20,183 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:55:20,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:55:20 BoogieIcfgContainer [2025-01-09 05:55:20,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:55:20,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:55:20,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:55:20,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:55:20,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:55:12" (1/3) ... [2025-01-09 05:55:20,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3315b30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:55:20, skipping insertion in model container [2025-01-09 05:55:20,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:14" (2/3) ... [2025-01-09 05:55:20,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3315b30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:55:20, skipping insertion in model container [2025-01-09 05:55:20,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:55:20" (3/3) ... [2025-01-09 05:55:20,200 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:55:20,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:55:20,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 915 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:55:20,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:55:20,321 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;@3ff70e41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:55:20,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:55:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:55:20,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:20,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:20,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:20,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:20,347 INFO L85 PathProgramCache]: Analyzing trace with hash 259331945, now seen corresponding path program 1 times [2025-01-09 05:55:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687861329] [2025-01-09 05:55:20,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:20,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:55:20,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:55:20,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:20,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:20,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:20,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687861329] [2025-01-09 05:55:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687861329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:20,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:20,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:55:20,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970811221] [2025-01-09 05:55:20,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:20,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:55:20,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:20,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:55:20,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:55:20,711 INFO L87 Difference]: Start difference. First operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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:55:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:20,813 INFO L93 Difference]: Finished difference Result 1783 states and 3381 transitions. [2025-01-09 05:55:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:55:20,815 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:55:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:20,838 INFO L225 Difference]: With dead ends: 1783 [2025-01-09 05:55:20,838 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 05:55:20,845 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:55:20,849 INFO L435 NwaCegarLoop]: 1669 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, 1669 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:55:20,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 05:55:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-01-09 05:55:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.892688679245283) internal successors, (1605), 849 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1605 transitions. [2025-01-09 05:55:20,934 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1605 transitions. Word has length 26 [2025-01-09 05:55:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:20,935 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1605 transitions. [2025-01-09 05:55:20,935 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:55:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1605 transitions. [2025-01-09 05:55:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:55:20,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:20,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:20,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:55:20,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:20,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash -558316505, now seen corresponding path program 1 times [2025-01-09 05:55:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124590451] [2025-01-09 05:55:20,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:20,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:55:20,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:55:20,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124590451] [2025-01-09 05:55:21,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124590451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:21,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:21,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:55:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205398871] [2025-01-09 05:55:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:21,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:55:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:21,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:55:21,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:21,242 INFO L87 Difference]: Start difference. First operand 850 states and 1605 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:21,375 INFO L93 Difference]: Finished difference Result 904 states and 1689 transitions. [2025-01-09 05:55:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:55:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 05:55:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:21,383 INFO L225 Difference]: With dead ends: 904 [2025-01-09 05:55:21,383 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 05:55:21,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:21,385 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6367 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:21,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6367 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 05:55:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-01-09 05:55:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.8455188679245282) internal successors, (1565), 849 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1565 transitions. [2025-01-09 05:55:21,418 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1565 transitions. Word has length 26 [2025-01-09 05:55:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:21,418 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1565 transitions. [2025-01-09 05:55:21,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1565 transitions. [2025-01-09 05:55:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:55:21,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:21,422 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:55:21,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:55:21,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:21,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1477044992, now seen corresponding path program 1 times [2025-01-09 05:55:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:21,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274917092] [2025-01-09 05:55:21,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:21,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:55:21,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:55:21,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:21,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:21,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274917092] [2025-01-09 05:55:21,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274917092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:21,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111559058] [2025-01-09 05:55:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:21,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:55:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:21,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:55:21,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:55:21,689 INFO L87 Difference]: Start difference. First operand 850 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 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:55:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:27,735 INFO L93 Difference]: Finished difference Result 3105 states and 5874 transitions. [2025-01-09 05:55:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:55:27,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 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:55:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:27,749 INFO L225 Difference]: With dead ends: 3105 [2025-01-09 05:55:27,749 INFO L226 Difference]: Without dead ends: 2352 [2025-01-09 05:55:27,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:27,754 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 2433 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2433 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:27,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2433 Valid, 837 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 05:55:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2025-01-09 05:55:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2352. [2025-01-09 05:55:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2350 states have (on average 1.5706382978723403) internal successors, (3691), 2351 states have internal predecessors, (3691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3691 transitions. [2025-01-09 05:55:27,826 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3691 transitions. Word has length 60 [2025-01-09 05:55:27,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:27,827 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3691 transitions. [2025-01-09 05:55:27,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 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:55:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3691 transitions. [2025-01-09 05:55:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:55:27,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:27,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:27,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:55:27,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:27,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1992870259, now seen corresponding path program 1 times [2025-01-09 05:55:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:27,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830827800] [2025-01-09 05:55:27,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:27,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:27,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:55:27,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:55:27,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:27,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830827800] [2025-01-09 05:55:28,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830827800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:28,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:28,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897601405] [2025-01-09 05:55:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:28,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:28,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:28,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:28,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:28,101 INFO L87 Difference]: Start difference. First operand 2352 states and 3691 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:28,384 INFO L93 Difference]: Finished difference Result 2952 states and 4651 transitions. [2025-01-09 05:55:28,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:55:28,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:55:28,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:28,397 INFO L225 Difference]: With dead ends: 2952 [2025-01-09 05:55:28,397 INFO L226 Difference]: Without dead ends: 2902 [2025-01-09 05:55:28,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-01-09 05:55:28,400 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 9729 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9729 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:28,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9729 Valid, 3527 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2025-01-09 05:55:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2400. [2025-01-09 05:55:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2398 states have (on average 1.5713094245204338) internal successors, (3768), 2399 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3768 transitions. [2025-01-09 05:55:28,466 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3768 transitions. Word has length 65 [2025-01-09 05:55:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:28,466 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3768 transitions. [2025-01-09 05:55:28,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3768 transitions. [2025-01-09 05:55:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:55:28,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:28,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:28,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:55:28,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:28,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1822789277, now seen corresponding path program 1 times [2025-01-09 05:55:28,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:28,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498304514] [2025-01-09 05:55:28,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:28,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:55:28,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:55:28,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:28,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:28,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:28,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498304514] [2025-01-09 05:55:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498304514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:28,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:28,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:28,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807887184] [2025-01-09 05:55:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:28,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:28,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:28,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:28,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:28,611 INFO L87 Difference]: Start difference. First operand 2400 states and 3768 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:28,651 INFO L93 Difference]: Finished difference Result 2585 states and 4063 transitions. [2025-01-09 05:55:28,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:28,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:55:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:28,663 INFO L225 Difference]: With dead ends: 2585 [2025-01-09 05:55:28,663 INFO L226 Difference]: Without dead ends: 2487 [2025-01-09 05:55:28,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:28,665 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1492 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:28,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1634 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2025-01-09 05:55:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2483. [2025-01-09 05:55:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5711406690850465) internal successors, (3898), 2482 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3898 transitions. [2025-01-09 05:55:28,721 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3898 transitions. Word has length 67 [2025-01-09 05:55:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:28,721 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3898 transitions. [2025-01-09 05:55:28,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3898 transitions. [2025-01-09 05:55:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:55:28,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:28,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:28,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:55:28,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:28,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:28,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1756295765, now seen corresponding path program 1 times [2025-01-09 05:55:28,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:28,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542813963] [2025-01-09 05:55:28,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:28,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:28,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:55:28,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:55:28,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:28,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:29,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542813963] [2025-01-09 05:55:29,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542813963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:29,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:29,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:29,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691464428] [2025-01-09 05:55:29,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:29,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:29,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:29,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:29,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:29,110 INFO L87 Difference]: Start difference. First operand 2483 states and 3898 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:29,413 INFO L93 Difference]: Finished difference Result 2666 states and 4186 transitions. [2025-01-09 05:55:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:55:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:29,424 INFO L225 Difference]: With dead ends: 2666 [2025-01-09 05:55:29,424 INFO L226 Difference]: Without dead ends: 2485 [2025-01-09 05:55:29,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 05:55:29,426 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 7515 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7515 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:29,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7515 Valid, 1941 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-01-09 05:55:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2483. [2025-01-09 05:55:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.570334542523176) internal successors, (3896), 2482 states have internal predecessors, (3896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3896 transitions. [2025-01-09 05:55:29,488 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3896 transitions. Word has length 67 [2025-01-09 05:55:29,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:29,488 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3896 transitions. [2025-01-09 05:55:29,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3896 transitions. [2025-01-09 05:55:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:55:29,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:29,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:29,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:55:29,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:29,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash 974683136, now seen corresponding path program 1 times [2025-01-09 05:55:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:29,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964050541] [2025-01-09 05:55:29,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:29,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:29,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:55:29,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:55:29,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:29,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:29,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:29,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964050541] [2025-01-09 05:55:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964050541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:29,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:29,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:55:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127452939] [2025-01-09 05:55:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:55:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:29,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:55:29,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:29,734 INFO L87 Difference]: Start difference. First operand 2483 states and 3896 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:29,772 INFO L93 Difference]: Finished difference Result 2491 states and 3905 transitions. [2025-01-09 05:55:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:55:29,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 05:55:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:29,784 INFO L225 Difference]: With dead ends: 2491 [2025-01-09 05:55:29,785 INFO L226 Difference]: Without dead ends: 2489 [2025-01-09 05:55:29,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:29,787 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 0 mSDsluCounter, 4677 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6239 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:29,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6239 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-01-09 05:55:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2489. [2025-01-09 05:55:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2487 states have (on average 1.5685564937675915) internal successors, (3901), 2488 states have internal predecessors, (3901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3901 transitions. [2025-01-09 05:55:29,845 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3901 transitions. Word has length 68 [2025-01-09 05:55:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:29,847 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 3901 transitions. [2025-01-09 05:55:29,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3901 transitions. [2025-01-09 05:55:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:29,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:29,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:29,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:55:29,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:29,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash 523852843, now seen corresponding path program 1 times [2025-01-09 05:55:29,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:29,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308016519] [2025-01-09 05:55:29,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:29,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:29,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:29,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:29,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:29,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:29,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308016519] [2025-01-09 05:55:29,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308016519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:29,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:29,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:29,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313279321] [2025-01-09 05:55:29,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:29,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:29,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:29,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:29,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:29,933 INFO L87 Difference]: Start difference. First operand 2489 states and 3901 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:29,963 INFO L93 Difference]: Finished difference Result 2847 states and 4453 transitions. [2025-01-09 05:55:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:29,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:55:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:29,975 INFO L225 Difference]: With dead ends: 2847 [2025-01-09 05:55:29,975 INFO L226 Difference]: Without dead ends: 2660 [2025-01-09 05:55:29,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:29,978 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1507 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:29,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-01-09 05:55:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2658. [2025-01-09 05:55:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2656 states have (on average 1.5655120481927711) internal successors, (4158), 2657 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4158 transitions. [2025-01-09 05:55:30,046 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4158 transitions. Word has length 69 [2025-01-09 05:55:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:30,046 INFO L471 AbstractCegarLoop]: Abstraction has 2658 states and 4158 transitions. [2025-01-09 05:55:30,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4158 transitions. [2025-01-09 05:55:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:30,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:30,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:30,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:55:30,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:30,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash 787709227, now seen corresponding path program 1 times [2025-01-09 05:55:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:30,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832947580] [2025-01-09 05:55:30,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:30,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:30,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:30,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:30,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:30,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:30,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:30,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832947580] [2025-01-09 05:55:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832947580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:30,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:30,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259139512] [2025-01-09 05:55:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:30,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:30,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:30,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:30,119 INFO L87 Difference]: Start difference. First operand 2658 states and 4158 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:30,157 INFO L93 Difference]: Finished difference Result 3338 states and 5196 transitions. [2025-01-09 05:55:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:30,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:55:30,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:30,168 INFO L225 Difference]: With dead ends: 3338 [2025-01-09 05:55:30,168 INFO L226 Difference]: Without dead ends: 2982 [2025-01-09 05:55:30,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:30,172 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1505 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:30,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1709 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-01-09 05:55:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2980. [2025-01-09 05:55:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2978 states have (on average 1.5580926796507724) internal successors, (4640), 2979 states have internal predecessors, (4640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4640 transitions. [2025-01-09 05:55:30,235 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4640 transitions. Word has length 69 [2025-01-09 05:55:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:30,235 INFO L471 AbstractCegarLoop]: Abstraction has 2980 states and 4640 transitions. [2025-01-09 05:55:30,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4640 transitions. [2025-01-09 05:55:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:30,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:30,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:30,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:55:30,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2025971243, now seen corresponding path program 1 times [2025-01-09 05:55:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:30,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815297177] [2025-01-09 05:55:30,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:30,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:30,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:30,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:30,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:30,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815297177] [2025-01-09 05:55:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815297177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:30,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:30,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:30,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451854456] [2025-01-09 05:55:30,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:30,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:30,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:30,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:30,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:30,299 INFO L87 Difference]: Start difference. First operand 2980 states and 4640 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:30,337 INFO L93 Difference]: Finished difference Result 4272 states and 6586 transitions. [2025-01-09 05:55:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:30,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:55:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:30,352 INFO L225 Difference]: With dead ends: 4272 [2025-01-09 05:55:30,352 INFO L226 Difference]: Without dead ends: 3594 [2025-01-09 05:55:30,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:30,355 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1503 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:30,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1711 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:30,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-01-09 05:55:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2025-01-09 05:55:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3590 states have (on average 1.543175487465181) internal successors, (5540), 3591 states have internal predecessors, (5540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5540 transitions. [2025-01-09 05:55:30,436 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5540 transitions. Word has length 69 [2025-01-09 05:55:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:30,436 INFO L471 AbstractCegarLoop]: Abstraction has 3592 states and 5540 transitions. [2025-01-09 05:55:30,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5540 transitions. [2025-01-09 05:55:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:30,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:30,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:30,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:55:30,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:30,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:30,438 INFO L85 PathProgramCache]: Analyzing trace with hash -189497557, now seen corresponding path program 1 times [2025-01-09 05:55:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:30,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589612522] [2025-01-09 05:55:30,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:30,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:30,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:30,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:30,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:30,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589612522] [2025-01-09 05:55:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589612522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:30,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:30,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:30,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576436108] [2025-01-09 05:55:30,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:30,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:30,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:30,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:30,498 INFO L87 Difference]: Start difference. First operand 3592 states and 5540 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:30,558 INFO L93 Difference]: Finished difference Result 6044 states and 9174 transitions. [2025-01-09 05:55:30,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:30,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:55:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:30,574 INFO L225 Difference]: With dead ends: 6044 [2025-01-09 05:55:30,575 INFO L226 Difference]: Without dead ends: 4754 [2025-01-09 05:55:30,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:30,579 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1501 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:30,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1713 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2025-01-09 05:55:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4752. [2025-01-09 05:55:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4750 states have (on average 1.5183157894736843) internal successors, (7212), 4751 states have internal predecessors, (7212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 7212 transitions. [2025-01-09 05:55:30,711 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 7212 transitions. Word has length 69 [2025-01-09 05:55:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:30,711 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 7212 transitions. [2025-01-09 05:55:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 7212 transitions. [2025-01-09 05:55:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:30,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:30,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:30,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:55:30,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:30,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1591435307, now seen corresponding path program 1 times [2025-01-09 05:55:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:30,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504179994] [2025-01-09 05:55:30,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:30,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:30,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:30,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:30,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:30,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:30,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504179994] [2025-01-09 05:55:30,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504179994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:30,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:30,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:30,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847723999] [2025-01-09 05:55:30,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:30,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:30,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:30,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:30,784 INFO L87 Difference]: Start difference. First operand 4752 states and 7212 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:30,917 INFO L93 Difference]: Finished difference Result 9396 states and 13966 transitions. [2025-01-09 05:55:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:30,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:55:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:30,939 INFO L225 Difference]: With dead ends: 9396 [2025-01-09 05:55:30,940 INFO L226 Difference]: Without dead ends: 6946 [2025-01-09 05:55:30,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:30,947 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1499 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:30,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1715 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2025-01-09 05:55:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6944. [2025-01-09 05:55:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6944 states, 6942 states have (on average 1.4837222702391242) internal successors, (10300), 6943 states have internal predecessors, (10300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6944 states to 6944 states and 10300 transitions. [2025-01-09 05:55:31,126 INFO L78 Accepts]: Start accepts. Automaton has 6944 states and 10300 transitions. Word has length 69 [2025-01-09 05:55:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:31,126 INFO L471 AbstractCegarLoop]: Abstraction has 6944 states and 10300 transitions. [2025-01-09 05:55:31,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6944 states and 10300 transitions. [2025-01-09 05:55:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 05:55:31,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:31,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:31,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:55:31,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:31,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:31,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1172876230, now seen corresponding path program 1 times [2025-01-09 05:55:31,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:31,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324320862] [2025-01-09 05:55:31,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:31,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 05:55:31,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 05:55:31,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:31,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:31,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:31,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324320862] [2025-01-09 05:55:31,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324320862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:31,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:31,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:31,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108323141] [2025-01-09 05:55:31,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:31,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:31,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:31,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:31,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:31,190 INFO L87 Difference]: Start difference. First operand 6944 states and 10300 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:31,309 INFO L93 Difference]: Finished difference Result 11815 states and 17410 transitions. [2025-01-09 05:55:31,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:31,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 05:55:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:31,331 INFO L225 Difference]: With dead ends: 11815 [2025-01-09 05:55:31,331 INFO L226 Difference]: Without dead ends: 9188 [2025-01-09 05:55:31,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:31,338 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1506 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:31,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9188 states. [2025-01-09 05:55:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9188 to 9186. [2025-01-09 05:55:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9186 states, 9184 states have (on average 1.4666811846689896) internal successors, (13470), 9185 states have internal predecessors, (13470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9186 states to 9186 states and 13470 transitions. [2025-01-09 05:55:31,568 INFO L78 Accepts]: Start accepts. Automaton has 9186 states and 13470 transitions. Word has length 71 [2025-01-09 05:55:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:31,568 INFO L471 AbstractCegarLoop]: Abstraction has 9186 states and 13470 transitions. [2025-01-09 05:55:31,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 9186 states and 13470 transitions. [2025-01-09 05:55:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:31,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:31,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:31,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:55:31,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:31,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1167843191, now seen corresponding path program 1 times [2025-01-09 05:55:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117911900] [2025-01-09 05:55:31,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:31,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:31,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:31,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:31,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:55:31,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:31,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117911900] [2025-01-09 05:55:31,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117911900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:31,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:31,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:31,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569025553] [2025-01-09 05:55:31,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:31,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:31,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:31,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:31,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:31,761 INFO L87 Difference]: Start difference. First operand 9186 states and 13470 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:32,769 INFO L93 Difference]: Finished difference Result 51920 states and 74597 transitions. [2025-01-09 05:55:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:32,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:32,890 INFO L225 Difference]: With dead ends: 51920 [2025-01-09 05:55:32,891 INFO L226 Difference]: Without dead ends: 45038 [2025-01-09 05:55:32,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:32,919 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 8053 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8053 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:32,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8053 Valid, 4043 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:55:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45038 states. [2025-01-09 05:55:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45038 to 16066. [2025-01-09 05:55:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16066 states, 16064 states have (on average 1.4460906374501992) internal successors, (23230), 16065 states have internal predecessors, (23230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16066 states to 16066 states and 23230 transitions. [2025-01-09 05:55:33,608 INFO L78 Accepts]: Start accepts. Automaton has 16066 states and 23230 transitions. Word has length 90 [2025-01-09 05:55:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:33,609 INFO L471 AbstractCegarLoop]: Abstraction has 16066 states and 23230 transitions. [2025-01-09 05:55:33,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 16066 states and 23230 transitions. [2025-01-09 05:55:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:33,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:33,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:33,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:55:33,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:33,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash -903986807, now seen corresponding path program 1 times [2025-01-09 05:55:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:33,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681756602] [2025-01-09 05:55:33,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:33,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:33,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:33,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:33,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:33,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:55:33,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:33,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681756602] [2025-01-09 05:55:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681756602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:33,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:33,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868312750] [2025-01-09 05:55:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:33,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:33,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:33,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:33,827 INFO L87 Difference]: Start difference. First operand 16066 states and 23230 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:34,851 INFO L93 Difference]: Finished difference Result 58800 states and 84357 transitions. [2025-01-09 05:55:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:34,984 INFO L225 Difference]: With dead ends: 58800 [2025-01-09 05:55:34,985 INFO L226 Difference]: Without dead ends: 51918 [2025-01-09 05:55:35,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:35,014 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 8078 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8078 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:35,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8078 Valid, 3936 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51918 states. [2025-01-09 05:55:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51918 to 26402. [2025-01-09 05:55:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26402 states, 26400 states have (on average 1.431439393939394) internal successors, (37790), 26401 states have internal predecessors, (37790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26402 states to 26402 states and 37790 transitions. [2025-01-09 05:55:35,826 INFO L78 Accepts]: Start accepts. Automaton has 26402 states and 37790 transitions. Word has length 90 [2025-01-09 05:55:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:35,826 INFO L471 AbstractCegarLoop]: Abstraction has 26402 states and 37790 transitions. [2025-01-09 05:55:35,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 26402 states and 37790 transitions. [2025-01-09 05:55:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:35,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:35,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:35,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:55:35,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:35,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash 334275209, now seen corresponding path program 1 times [2025-01-09 05:55:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:35,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525886488] [2025-01-09 05:55:35,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:35,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:35,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:35,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:35,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:55:36,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:36,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525886488] [2025-01-09 05:55:36,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525886488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:36,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:36,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423034783] [2025-01-09 05:55:36,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:36,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:36,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:36,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:36,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:36,103 INFO L87 Difference]: Start difference. First operand 26402 states and 37790 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:37,595 INFO L93 Difference]: Finished difference Result 65680 states and 94117 transitions. [2025-01-09 05:55:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:37,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:37,743 INFO L225 Difference]: With dead ends: 65680 [2025-01-09 05:55:37,744 INFO L226 Difference]: Without dead ends: 58798 [2025-01-09 05:55:37,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:37,780 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8119 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8119 SdHoareTripleChecker+Valid, 3891 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:37,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8119 Valid, 3891 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58798 states. [2025-01-09 05:55:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58798 to 33282. [2025-01-09 05:55:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33282 states, 33280 states have (on average 1.4287860576923077) internal successors, (47550), 33281 states have internal predecessors, (47550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33282 states to 33282 states and 47550 transitions. [2025-01-09 05:55:38,866 INFO L78 Accepts]: Start accepts. Automaton has 33282 states and 47550 transitions. Word has length 90 [2025-01-09 05:55:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:38,866 INFO L471 AbstractCegarLoop]: Abstraction has 33282 states and 47550 transitions. [2025-01-09 05:55:38,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 33282 states and 47550 transitions. [2025-01-09 05:55:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:38,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:38,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:38,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:55:38,872 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:38,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1881193591, now seen corresponding path program 1 times [2025-01-09 05:55:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928992834] [2025-01-09 05:55:38,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:38,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:38,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:38,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:38,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:55:39,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:39,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928992834] [2025-01-09 05:55:39,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928992834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:39,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:39,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:39,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656161558] [2025-01-09 05:55:39,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:39,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:39,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:39,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:39,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:39,061 INFO L87 Difference]: Start difference. First operand 33282 states and 47550 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:40,189 INFO L93 Difference]: Finished difference Result 72560 states and 103877 transitions. [2025-01-09 05:55:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:40,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:40,320 INFO L225 Difference]: With dead ends: 72560 [2025-01-09 05:55:40,321 INFO L226 Difference]: Without dead ends: 65678 [2025-01-09 05:55:40,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:40,352 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8172 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8172 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:40,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8172 Valid, 3895 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65678 states. [2025-01-09 05:55:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65678 to 40162. [2025-01-09 05:55:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40162 states, 40160 states have (on average 1.4270418326693226) internal successors, (57310), 40161 states have internal predecessors, (57310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40162 states to 40162 states and 57310 transitions. [2025-01-09 05:55:41,681 INFO L78 Accepts]: Start accepts. Automaton has 40162 states and 57310 transitions. Word has length 90 [2025-01-09 05:55:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:41,682 INFO L471 AbstractCegarLoop]: Abstraction has 40162 states and 57310 transitions. [2025-01-09 05:55:41,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 40162 states and 57310 transitions. [2025-01-09 05:55:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:41,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:41,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:41,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:55:41,688 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:41,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -100260727, now seen corresponding path program 1 times [2025-01-09 05:55:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:41,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453138712] [2025-01-09 05:55:41,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:41,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:41,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:41,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:41,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:55:41,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:41,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453138712] [2025-01-09 05:55:41,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453138712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:41,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:41,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146285170] [2025-01-09 05:55:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:41,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:41,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:41,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:41,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:41,913 INFO L87 Difference]: Start difference. First operand 40162 states and 57310 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:43,891 INFO L93 Difference]: Finished difference Result 79440 states and 113637 transitions. [2025-01-09 05:55:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:43,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:43,990 INFO L225 Difference]: With dead ends: 79440 [2025-01-09 05:55:43,990 INFO L226 Difference]: Without dead ends: 72558 [2025-01-09 05:55:44,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:44,009 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8072 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8072 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:44,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8072 Valid, 3988 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72558 states. [2025-01-09 05:55:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72558 to 47042. [2025-01-09 05:55:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47042 states, 47040 states have (on average 1.4258078231292517) internal successors, (67070), 47041 states have internal predecessors, (67070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47042 states to 47042 states and 67070 transitions. [2025-01-09 05:55:45,259 INFO L78 Accepts]: Start accepts. Automaton has 47042 states and 67070 transitions. Word has length 90 [2025-01-09 05:55:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:45,260 INFO L471 AbstractCegarLoop]: Abstraction has 47042 states and 67070 transitions. [2025-01-09 05:55:45,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 47042 states and 67070 transitions. [2025-01-09 05:55:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:55:45,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:45,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:45,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:55:45,265 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:45,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1634924353, now seen corresponding path program 1 times [2025-01-09 05:55:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673401997] [2025-01-09 05:55:45,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:45,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:45,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:55:45,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:55:45,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:45,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:45,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673401997] [2025-01-09 05:55:45,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673401997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:45,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:45,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:45,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199842799] [2025-01-09 05:55:45,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:45,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:45,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:45,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:45,366 INFO L87 Difference]: Start difference. First operand 47042 states and 67070 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:46,228 INFO L93 Difference]: Finished difference Result 78684 states and 112439 transitions. [2025-01-09 05:55:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 05:55:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:46,283 INFO L225 Difference]: With dead ends: 78684 [2025-01-09 05:55:46,283 INFO L226 Difference]: Without dead ends: 33946 [2025-01-09 05:55:46,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:46,317 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 58 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:46,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3163 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33946 states. [2025-01-09 05:55:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33946 to 33944. [2025-01-09 05:55:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33944 states, 33942 states have (on average 1.4307937069117906) internal successors, (48564), 33943 states have internal predecessors, (48564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33944 states to 33944 states and 48564 transitions. [2025-01-09 05:55:47,458 INFO L78 Accepts]: Start accepts. Automaton has 33944 states and 48564 transitions. Word has length 92 [2025-01-09 05:55:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:47,459 INFO L471 AbstractCegarLoop]: Abstraction has 33944 states and 48564 transitions. [2025-01-09 05:55:47,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 33944 states and 48564 transitions. [2025-01-09 05:55:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:55:47,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:47,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:47,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:55:47,462 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:47,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1049374556, now seen corresponding path program 1 times [2025-01-09 05:55:47,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:47,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486116840] [2025-01-09 05:55:47,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:47,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:55:47,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:55:47,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:47,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:55:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:47,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486116840] [2025-01-09 05:55:47,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486116840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:47,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:47,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:47,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823199751] [2025-01-09 05:55:47,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:47,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:47,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:47,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:47,667 INFO L87 Difference]: Start difference. First operand 33944 states and 48564 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:48,896 INFO L93 Difference]: Finished difference Result 63142 states and 90427 transitions. [2025-01-09 05:55:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 05:55:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:48,967 INFO L225 Difference]: With dead ends: 63142 [2025-01-09 05:55:48,967 INFO L226 Difference]: Without dead ends: 58276 [2025-01-09 05:55:48,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:48,982 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 8056 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8056 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:48,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8056 Valid, 4214 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58276 states. [2025-01-09 05:55:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58276 to 38808. [2025-01-09 05:55:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38808 states, 38806 states have (on average 1.4295727464825028) internal successors, (55476), 38807 states have internal predecessors, (55476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38808 states to 38808 states and 55476 transitions. [2025-01-09 05:55:50,107 INFO L78 Accepts]: Start accepts. Automaton has 38808 states and 55476 transitions. Word has length 92 [2025-01-09 05:55:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:50,107 INFO L471 AbstractCegarLoop]: Abstraction has 38808 states and 55476 transitions. [2025-01-09 05:55:50,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 38808 states and 55476 transitions. [2025-01-09 05:55:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:55:50,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:50,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:50,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:55:50,111 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:50,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash 73439256, now seen corresponding path program 1 times [2025-01-09 05:55:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:50,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299192845] [2025-01-09 05:55:50,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:50,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:55:50,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:55:50,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:50,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299192845] [2025-01-09 05:55:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299192845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:50,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:50,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:50,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530890179] [2025-01-09 05:55:50,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:50,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:50,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:50,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:50,209 INFO L87 Difference]: Start difference. First operand 38808 states and 55476 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:50,809 INFO L93 Difference]: Finished difference Result 57052 states and 81398 transitions. [2025-01-09 05:55:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:50,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 05:55:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:50,847 INFO L225 Difference]: With dead ends: 57052 [2025-01-09 05:55:50,847 INFO L226 Difference]: Without dead ends: 20570 [2025-01-09 05:55:50,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:50,871 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 53 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:50,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2025-01-09 05:55:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20568. [2025-01-09 05:55:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20568 states, 20566 states have (on average 1.4254594962559564) internal successors, (29316), 20567 states have internal predecessors, (29316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20568 states to 20568 states and 29316 transitions. [2025-01-09 05:55:51,586 INFO L78 Accepts]: Start accepts. Automaton has 20568 states and 29316 transitions. Word has length 93 [2025-01-09 05:55:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:51,586 INFO L471 AbstractCegarLoop]: Abstraction has 20568 states and 29316 transitions. [2025-01-09 05:55:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 20568 states and 29316 transitions. [2025-01-09 05:55:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:55:51,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:51,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:51,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:55:51,588 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:51,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:51,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1541447286, now seen corresponding path program 1 times [2025-01-09 05:55:51,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:51,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040452460] [2025-01-09 05:55:51,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:51,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:55:51,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:55:51,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:51,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:51,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:51,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040452460] [2025-01-09 05:55:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040452460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:51,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394036484] [2025-01-09 05:55:51,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:51,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:51,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:51,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:51,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:51,713 INFO L87 Difference]: Start difference. First operand 20568 states and 29316 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:52,145 INFO L93 Difference]: Finished difference Result 29692 states and 42158 transitions. [2025-01-09 05:55:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:52,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 05:55:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:52,160 INFO L225 Difference]: With dead ends: 29692 [2025-01-09 05:55:52,160 INFO L226 Difference]: Without dead ends: 11450 [2025-01-09 05:55:52,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:52,175 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 50 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:52,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:52,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2025-01-09 05:55:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 11448. [2025-01-09 05:55:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11448 states, 11446 states have (on average 1.4289708195002622) internal successors, (16356), 11447 states have internal predecessors, (16356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11448 states to 11448 states and 16356 transitions. [2025-01-09 05:55:52,373 INFO L78 Accepts]: Start accepts. Automaton has 11448 states and 16356 transitions. Word has length 95 [2025-01-09 05:55:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:52,373 INFO L471 AbstractCegarLoop]: Abstraction has 11448 states and 16356 transitions. [2025-01-09 05:55:52,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 11448 states and 16356 transitions. [2025-01-09 05:55:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:55:52,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:52,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:52,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:55:52,374 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:52,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1705365884, now seen corresponding path program 1 times [2025-01-09 05:55:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:52,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686711094] [2025-01-09 05:55:52,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:52,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:52,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:55:52,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:55:52,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:52,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686711094] [2025-01-09 05:55:52,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686711094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:52,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630813412] [2025-01-09 05:55:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:52,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:52,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:52,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:52,456 INFO L87 Difference]: Start difference. First operand 11448 states and 16356 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:52,586 INFO L93 Difference]: Finished difference Result 16012 states and 22718 transitions. [2025-01-09 05:55:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:52,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 05:55:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:52,599 INFO L225 Difference]: With dead ends: 16012 [2025-01-09 05:55:52,599 INFO L226 Difference]: Without dead ends: 6890 [2025-01-09 05:55:52,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:52,609 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 47 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:52,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2025-01-09 05:55:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6888. [2025-01-09 05:55:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6888 states, 6886 states have (on average 1.4429276793494046) internal successors, (9936), 6887 states have internal predecessors, (9936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6888 states to 6888 states and 9936 transitions. [2025-01-09 05:55:52,767 INFO L78 Accepts]: Start accepts. Automaton has 6888 states and 9936 transitions. Word has length 97 [2025-01-09 05:55:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:52,767 INFO L471 AbstractCegarLoop]: Abstraction has 6888 states and 9936 transitions. [2025-01-09 05:55:52,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6888 states and 9936 transitions. [2025-01-09 05:55:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:55:52,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:52,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:52,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 05:55:52,770 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:52,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1668745198, now seen corresponding path program 1 times [2025-01-09 05:55:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:52,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651763812] [2025-01-09 05:55:52,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:52,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:52,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:55:52,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:55:52,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:52,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:52,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:52,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651763812] [2025-01-09 05:55:52,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651763812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:52,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:52,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57215200] [2025-01-09 05:55:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:52,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:52,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:52,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:52,857 INFO L87 Difference]: Start difference. First operand 6888 states and 9936 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:52,935 INFO L93 Difference]: Finished difference Result 9172 states and 13088 transitions. [2025-01-09 05:55:52,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:52,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-01-09 05:55:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:52,945 INFO L225 Difference]: With dead ends: 9172 [2025-01-09 05:55:52,945 INFO L226 Difference]: Without dead ends: 4610 [2025-01-09 05:55:52,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:52,951 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 44 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:52,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3103 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-01-09 05:55:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4608. [2025-01-09 05:55:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4608 states, 4606 states have (on average 1.4667824576639166) internal successors, (6756), 4607 states have internal predecessors, (6756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 6756 transitions. [2025-01-09 05:55:53,073 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 6756 transitions. Word has length 99 [2025-01-09 05:55:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:53,073 INFO L471 AbstractCegarLoop]: Abstraction has 4608 states and 6756 transitions. [2025-01-09 05:55:53,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 6756 transitions. [2025-01-09 05:55:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 05:55:53,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:53,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:53,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 05:55:53,075 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:53,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash -109173536, now seen corresponding path program 1 times [2025-01-09 05:55:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768876886] [2025-01-09 05:55:53,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:53,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:55:53,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:55:53,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:53,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:53,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768876886] [2025-01-09 05:55:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768876886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:53,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:53,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407649582] [2025-01-09 05:55:53,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:53,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:53,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:53,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:53,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:53,193 INFO L87 Difference]: Start difference. First operand 4608 states and 6756 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:53,266 INFO L93 Difference]: Finished difference Result 5752 states and 8318 transitions. [2025-01-09 05:55:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-01-09 05:55:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:53,273 INFO L225 Difference]: With dead ends: 5752 [2025-01-09 05:55:53,274 INFO L226 Difference]: Without dead ends: 3470 [2025-01-09 05:55:53,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:53,277 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 41 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:53,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3088 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-01-09 05:55:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3468. [2025-01-09 05:55:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3466 states have (on average 1.494806693594922) internal successors, (5181), 3467 states have internal predecessors, (5181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 5181 transitions. [2025-01-09 05:55:53,352 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 5181 transitions. Word has length 101 [2025-01-09 05:55:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:53,353 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 5181 transitions. [2025-01-09 05:55:53,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 5181 transitions. [2025-01-09 05:55:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 05:55:53,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:53,354 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:53,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:55:53,355 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:53,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1223800750, now seen corresponding path program 1 times [2025-01-09 05:55:53,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:53,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563394054] [2025-01-09 05:55:53,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:53,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:53,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:55:53,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:55:53,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:53,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:54,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563394054] [2025-01-09 05:55:54,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563394054] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344077833] [2025-01-09 05:55:54,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:54,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:54,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:54,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:55:54,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:55:54,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:55:54,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:55:54,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:54,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:54,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 05:55:54,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:54,812 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:55:54,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:55,663 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:55:55,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344077833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:55,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:55,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-01-09 05:55:55,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275008351] [2025-01-09 05:55:55,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:55,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:55:55,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:55,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:55:55,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:55:55,668 INFO L87 Difference]: Start difference. First operand 3468 states and 5181 transitions. Second operand has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:00,035 INFO L93 Difference]: Finished difference Result 14194 states and 19563 transitions. [2025-01-09 05:56:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-01-09 05:56:00,036 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 05:56:00,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:00,049 INFO L225 Difference]: With dead ends: 14194 [2025-01-09 05:56:00,050 INFO L226 Difference]: Without dead ends: 12954 [2025-01-09 05:56:00,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-01-09 05:56:00,055 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 17837 mSDsluCounter, 9972 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17837 SdHoareTripleChecker+Valid, 11523 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:00,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17837 Valid, 11523 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 05:56:00,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12954 states. [2025-01-09 05:56:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12954 to 12224. [2025-01-09 05:56:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12224 states, 12222 states have (on average 1.370724922271314) internal successors, (16753), 12223 states have internal predecessors, (16753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 16753 transitions. [2025-01-09 05:56:00,309 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 16753 transitions. Word has length 103 [2025-01-09 05:56:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:00,309 INFO L471 AbstractCegarLoop]: Abstraction has 12224 states and 16753 transitions. [2025-01-09 05:56:00,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 16753 transitions. [2025-01-09 05:56:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:56:00,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:00,311 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:56:00,321 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:56:00,511 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:56:00,512 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:00,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1075439892, now seen corresponding path program 1 times [2025-01-09 05:56:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892224023] [2025-01-09 05:56:00,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:00,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:56:00,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:56:00,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:00,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:02,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892224023] [2025-01-09 05:56:02,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892224023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:56:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069186993] [2025-01-09 05:56:02,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:02,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:02,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:02,013 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:56:02,014 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:56:02,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:56:02,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:56:02,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:02,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:02,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:56:02,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:56:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:02,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:56:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069186993] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:56:03,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:56:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-01-09 05:56:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046273272] [2025-01-09 05:56:03,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:56:03,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 05:56:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:03,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 05:56:03,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-01-09 05:56:03,551 INFO L87 Difference]: Start difference. First operand 12224 states and 16753 transitions. Second operand has 26 states, 26 states have (on average 10.307692307692308) internal successors, (268), 25 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:04,700 INFO L93 Difference]: Finished difference Result 32654 states and 43948 transitions. [2025-01-09 05:56:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 05:56:04,701 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.307692307692308) internal successors, (268), 25 states have internal predecessors, (268), 0 states have call successors, (0), 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:56:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:04,721 INFO L225 Difference]: With dead ends: 32654 [2025-01-09 05:56:04,721 INFO L226 Difference]: Without dead ends: 22890 [2025-01-09 05:56:04,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 05:56:04,726 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 17487 mSDsluCounter, 6418 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17487 SdHoareTripleChecker+Valid, 7944 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:04,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17487 Valid, 7944 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:56:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22890 states. [2025-01-09 05:56:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22890 to 22596. [2025-01-09 05:56:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22596 states, 22594 states have (on average 1.3338939541471186) internal successors, (30138), 22595 states have internal predecessors, (30138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22596 states to 22596 states and 30138 transitions. [2025-01-09 05:56:05,414 INFO L78 Accepts]: Start accepts. Automaton has 22596 states and 30138 transitions. Word has length 104 [2025-01-09 05:56:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:05,414 INFO L471 AbstractCegarLoop]: Abstraction has 22596 states and 30138 transitions. [2025-01-09 05:56:05,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.307692307692308) internal successors, (268), 25 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 22596 states and 30138 transitions. [2025-01-09 05:56:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:56:05,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:05,417 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:56:05,427 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:56:05,618 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:56:05,619 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:05,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash 37307156, now seen corresponding path program 1 times [2025-01-09 05:56:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737296766] [2025-01-09 05:56:05,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:05,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:56:05,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:56:05,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:05,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:06,313 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:56:06,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:06,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737296766] [2025-01-09 05:56:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737296766] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:56:06,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175249229] [2025-01-09 05:56:06,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:06,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:06,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:06,317 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:56:06,318 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:56:06,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:56:06,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:56:06,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:06,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:06,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 05:56:06,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:56:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:08,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:56:10,442 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:56:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175249229] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:56:10,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:56:10,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 18] total 39 [2025-01-09 05:56:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868932161] [2025-01-09 05:56:10,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:56:10,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 05:56:10,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:10,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 05:56:10,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1205, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 05:56:10,444 INFO L87 Difference]: Start difference. First operand 22596 states and 30138 transitions. Second operand has 39 states, 39 states have (on average 6.615384615384615) internal successors, (258), 39 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:13,992 INFO L93 Difference]: Finished difference Result 74666 states and 98911 transitions. [2025-01-09 05:56:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 05:56:13,993 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 6.615384615384615) internal successors, (258), 39 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:56:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:14,051 INFO L225 Difference]: With dead ends: 74666 [2025-01-09 05:56:14,051 INFO L226 Difference]: Without dead ends: 54518 [2025-01-09 05:56:14,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1378, Invalid=4474, Unknown=0, NotChecked=0, Total=5852 [2025-01-09 05:56:14,068 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 19285 mSDsluCounter, 14191 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19285 SdHoareTripleChecker+Valid, 15698 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:14,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19285 Valid, 15698 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:56:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54518 states. [2025-01-09 05:56:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54518 to 44220. [2025-01-09 05:56:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44220 states, 44218 states have (on average 1.318060518340947) internal successors, (58282), 44219 states have internal predecessors, (58282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44220 states to 44220 states and 58282 transitions. [2025-01-09 05:56:15,615 INFO L78 Accepts]: Start accepts. Automaton has 44220 states and 58282 transitions. Word has length 104 [2025-01-09 05:56:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:15,615 INFO L471 AbstractCegarLoop]: Abstraction has 44220 states and 58282 transitions. [2025-01-09 05:56:15,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.615384615384615) internal successors, (258), 39 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 44220 states and 58282 transitions. [2025-01-09 05:56:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:56:15,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:15,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:15,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:56:15,817 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:56:15,817 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:15,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:15,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2036668468, now seen corresponding path program 1 times [2025-01-09 05:56:15,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:15,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159429825] [2025-01-09 05:56:15,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:15,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:15,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:56:15,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:56:15,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:15,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:16,165 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:56:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159429825] [2025-01-09 05:56:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159429825] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:56:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103770683] [2025-01-09 05:56:16,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:16,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:16,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:16,169 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:56:16,171 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:56:16,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:56:16,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:56:16,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:16,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:16,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:56:16,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:56:16,627 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:56:16,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:56:17,306 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:56:17,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103770683] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:56:17,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:56:17,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:56:17,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716154199] [2025-01-09 05:56:17,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:56:17,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:56:17,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:17,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:56:17,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:56:17,308 INFO L87 Difference]: Start difference. First operand 44220 states and 58282 transitions. Second operand has 21 states, 21 states have (on average 10.619047619047619) internal successors, (223), 20 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)