./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c07e007f9f3a362ec25382ccff24a1aeded702728f7c63228a63ffce5d34476e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:50:38,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:50:38,850 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:50:38,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:50:38,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:50:38,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:50:38,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:50:38,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:50:38,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:50:38,871 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:50:38,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:50:38,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:50:38,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:50:38,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:50:38,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:50:38,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:50:38,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:50:38,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:50:38,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:50:38,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:50:38,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:50:38,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:50:38,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:50:38,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:50:38,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:50:38,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:50:38,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:50:38,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:50:38,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:50:38,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:50:38,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:50:38,874 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:50:38,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:50:38,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:50:38,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:50:38,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:50:38,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:50:38,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:50:38,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:50:38,875 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 -> c07e007f9f3a362ec25382ccff24a1aeded702728f7c63228a63ffce5d34476e [2025-01-09 05:50:39,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:50:39,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:50:39,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:50:39,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:50:39,156 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:50:39,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.c [2025-01-09 05:50:40,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1b7b645a/3d1f39e17f1c4277aab240969f151cad/FLAGfc0297bb5 [2025-01-09 05:50:41,203 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:50:41,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.c [2025-01-09 05:50:41,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1b7b645a/3d1f39e17f1c4277aab240969f151cad/FLAGfc0297bb5 [2025-01-09 05:50:41,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1b7b645a/3d1f39e17f1c4277aab240969f151cad [2025-01-09 05:50:41,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:50:41,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:50:41,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:50:41,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:50:41,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:50:41,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:50:41" (1/1) ... [2025-01-09 05:50:41,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eefd90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:41, skipping insertion in model container [2025-01-09 05:50:41,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:50:41" (1/1) ... [2025-01-09 05:50:41,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:50:41,710 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.5.ufo.BOUNDED-10.pals+Problem12_label07.c[11640,11653] [2025-01-09 05:50:41,751 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.5.ufo.BOUNDED-10.pals+Problem12_label07.c[12482,12495] [2025-01-09 05:50:42,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:50:42,515 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:50:42,551 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.5.ufo.BOUNDED-10.pals+Problem12_label07.c[11640,11653] [2025-01-09 05:50:42,553 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.5.ufo.BOUNDED-10.pals+Problem12_label07.c[12482,12495] [2025-01-09 05:50:42,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:50:42,871 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:50:42,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42 WrapperNode [2025-01-09 05:50:42,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:50:42,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:50:42,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:50:42,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:50:42,879 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:50:42" (1/1) ... [2025-01-09 05:50:42,925 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:50:42" (1/1) ... [2025-01-09 05:50:43,215 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5093 [2025-01-09 05:50:43,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:50:43,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:50:43,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:50:43,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:50:43,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,499 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:50:43,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:50:43,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:50:43,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:50:43,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:50:43,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (1/1) ... [2025-01-09 05:50:43,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:50:43,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:50:43,863 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:50:43,874 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:50:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:50:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:50:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:50:43,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:50:43,975 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:50:43,976 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:50:47,239 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-01-09 05:50:47,239 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:50:47,258 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:50:47,259 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:50:47,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:50:47 BoogieIcfgContainer [2025-01-09 05:50:47,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:50:47,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:50:47,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:50:47,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:50:47,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:50:41" (1/3) ... [2025-01-09 05:50:47,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48120dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:50:47, skipping insertion in model container [2025-01-09 05:50:47,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:50:42" (2/3) ... [2025-01-09 05:50:47,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48120dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:50:47, skipping insertion in model container [2025-01-09 05:50:47,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:50:47" (3/3) ... [2025-01-09 05:50:47,265 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.c [2025-01-09 05:50:47,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:50:47,277 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.c that has 1 procedures, 898 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:50:47,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:50:47,359 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;@1857f305, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:50:47,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:50:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 05:50:47,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:47,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:50:47,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:47,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2129271645, now seen corresponding path program 1 times [2025-01-09 05:50:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:47,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231905243] [2025-01-09 05:50:47,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:47,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 05:50:47,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 05:50:47,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:47,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:47,523 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:50:47,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:47,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231905243] [2025-01-09 05:50:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231905243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:47,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:50:47,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559075241] [2025-01-09 05:50:47,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:47,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:50:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:47,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:50:47,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:50:47,542 INFO L87 Difference]: Start difference. First operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:50,376 INFO L93 Difference]: Finished difference Result 2514 states and 4839 transitions. [2025-01-09 05:50:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:50:50,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 05:50:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:50,395 INFO L225 Difference]: With dead ends: 2514 [2025-01-09 05:50:50,396 INFO L226 Difference]: Without dead ends: 1584 [2025-01-09 05:50:50,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:50:50,401 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 1028 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:50,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 295 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 05:50:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-01-09 05:50:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2025-01-09 05:50:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1582 states have (on average 1.8413400758533502) internal successors, (2913), 1583 states have internal predecessors, (2913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2913 transitions. [2025-01-09 05:50:50,469 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2913 transitions. Word has length 7 [2025-01-09 05:50:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:50,470 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2913 transitions. [2025-01-09 05:50:50,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2913 transitions. [2025-01-09 05:50:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 05:50:50,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:50,471 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] [2025-01-09 05:50:50,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:50:50,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:50,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 276531059, now seen corresponding path program 1 times [2025-01-09 05:50:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:50,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341226695] [2025-01-09 05:50:50,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:50,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:50,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 05:50:50,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:50:50,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:50,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:50,654 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:50:50,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:50,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341226695] [2025-01-09 05:50:50,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341226695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:50,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:50,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:50:50,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783747502] [2025-01-09 05:50:50,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:50,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:50:50,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:50,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:50:50,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:50:50,657 INFO L87 Difference]: Start difference. First operand 1584 states and 2913 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:50,726 INFO L93 Difference]: Finished difference Result 1630 states and 2984 transitions. [2025-01-09 05:50:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:50:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-01-09 05:50:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:50,732 INFO L225 Difference]: With dead ends: 1630 [2025-01-09 05:50:50,732 INFO L226 Difference]: Without dead ends: 1584 [2025-01-09 05:50:50,733 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:50:50,733 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 0 mSDsluCounter, 4680 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:50,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6252 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:50:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-01-09 05:50:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2025-01-09 05:50:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1582 states have (on average 1.8217446270543616) internal successors, (2882), 1583 states have internal predecessors, (2882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2882 transitions. [2025-01-09 05:50:50,759 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2882 transitions. Word has length 24 [2025-01-09 05:50:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:50,759 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2882 transitions. [2025-01-09 05:50:50,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2882 transitions. [2025-01-09 05:50:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:50:50,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:50,760 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] [2025-01-09 05:50:50,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:50:50,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:50,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1743595638, now seen corresponding path program 1 times [2025-01-09 05:50:50,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:50,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551278822] [2025-01-09 05:50:50,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:50,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:50:50,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:50:50,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:50,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:51,018 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:50:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:51,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551278822] [2025-01-09 05:50:51,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551278822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:51,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:50:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203406304] [2025-01-09 05:50:51,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:51,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:50:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:51,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:50:51,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:50:51,022 INFO L87 Difference]: Start difference. First operand 1584 states and 2882 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:51,269 INFO L93 Difference]: Finished difference Result 2004 states and 3552 transitions. [2025-01-09 05:50:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 05:50:51,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-01-09 05:50:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:51,275 INFO L225 Difference]: With dead ends: 2004 [2025-01-09 05:50:51,275 INFO L226 Difference]: Without dead ends: 1962 [2025-01-09 05:50:51,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 05:50:51,279 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 7951 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7951 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:51,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7951 Valid, 2953 Invalid, 168 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:50:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-09 05:50:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1624. [2025-01-09 05:50:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.816276202219482) internal successors, (2946), 1623 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2946 transitions. [2025-01-09 05:50:51,315 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2946 transitions. Word has length 54 [2025-01-09 05:50:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:51,316 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2946 transitions. [2025-01-09 05:50:51,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2946 transitions. [2025-01-09 05:50:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:50:51,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:51,322 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] [2025-01-09 05:50:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:50:51,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1973859622, now seen corresponding path program 1 times [2025-01-09 05:50:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345010489] [2025-01-09 05:50:51,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:51,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:50:51,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:50:51,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:51,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:51,436 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:50:51,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:51,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345010489] [2025-01-09 05:50:51,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345010489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:51,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:51,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:50:51,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709023223] [2025-01-09 05:50:51,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:51,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:50:51,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:51,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:50:51,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:50:51,438 INFO L87 Difference]: Start difference. First operand 1624 states and 2946 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:51,487 INFO L93 Difference]: Finished difference Result 1777 states and 3189 transitions. [2025-01-09 05:50:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:50:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 05:50:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:51,493 INFO L225 Difference]: With dead ends: 1777 [2025-01-09 05:50:51,493 INFO L226 Difference]: Without dead ends: 1695 [2025-01-09 05:50:51,494 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:50:51,498 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:51,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:50:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-01-09 05:50:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2025-01-09 05:50:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.8060319337670019) internal successors, (3054), 1692 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3054 transitions. [2025-01-09 05:50:51,568 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3054 transitions. Word has length 56 [2025-01-09 05:50:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:51,569 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 3054 transitions. [2025-01-09 05:50:51,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3054 transitions. [2025-01-09 05:50:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:50:51,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:51,573 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] [2025-01-09 05:50:51,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:50:51,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:51,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1907366110, now seen corresponding path program 1 times [2025-01-09 05:50:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561980091] [2025-01-09 05:50:51,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:51,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:50:51,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:50:51,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:51,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:51,777 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:50:51,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561980091] [2025-01-09 05:50:51,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561980091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:51,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:51,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:50:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287544751] [2025-01-09 05:50:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:51,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:50:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:51,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:50:51,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:50:51,778 INFO L87 Difference]: Start difference. First operand 1693 states and 3054 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:51,903 INFO L93 Difference]: Finished difference Result 1846 states and 3294 transitions. [2025-01-09 05:50:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:50:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 05:50:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:51,909 INFO L225 Difference]: With dead ends: 1846 [2025-01-09 05:50:51,909 INFO L226 Difference]: Without dead ends: 1695 [2025-01-09 05:50:51,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:50:51,910 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 2994 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2994 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:51,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2994 Valid, 1795 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:50:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-01-09 05:50:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2025-01-09 05:50:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.8048492016558249) internal successors, (3052), 1692 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3052 transitions. [2025-01-09 05:50:51,936 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3052 transitions. Word has length 56 [2025-01-09 05:50:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:51,937 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 3052 transitions. [2025-01-09 05:50:51,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3052 transitions. [2025-01-09 05:50:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 05:50:51,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:51,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, 1, 1, 1, 1, 1, 1, 1, 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:50:51,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:50:51,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:51,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:51,938 INFO L85 PathProgramCache]: Analyzing trace with hash 586469650, now seen corresponding path program 1 times [2025-01-09 05:50:51,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:51,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409257144] [2025-01-09 05:50:51,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:51,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:51,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 05:50:51,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 05:50:51,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:51,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:52,165 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:50:52,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409257144] [2025-01-09 05:50:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409257144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:50:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877932471] [2025-01-09 05:50:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:52,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:50:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:52,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:50:52,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:50:52,167 INFO L87 Difference]: Start difference. First operand 1693 states and 3052 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:52,229 INFO L93 Difference]: Finished difference Result 1701 states and 3061 transitions. [2025-01-09 05:50:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:50:52,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-01-09 05:50:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:52,235 INFO L225 Difference]: With dead ends: 1701 [2025-01-09 05:50:52,236 INFO L226 Difference]: Without dead ends: 1699 [2025-01-09 05:50:52,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:50:52,237 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 0 mSDsluCounter, 9209 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10746 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:52,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10746 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:50:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-01-09 05:50:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2025-01-09 05:50:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1697 states have (on average 1.8014142604596346) internal successors, (3057), 1698 states have internal predecessors, (3057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3057 transitions. [2025-01-09 05:50:52,269 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3057 transitions. Word has length 57 [2025-01-09 05:50:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:52,269 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 3057 transitions. [2025-01-09 05:50:52,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3057 transitions. [2025-01-09 05:50:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:50:52,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:52,270 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] [2025-01-09 05:50:52,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:50:52,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:52,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:52,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1374136578, now seen corresponding path program 1 times [2025-01-09 05:50:52,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:52,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218400497] [2025-01-09 05:50:52,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:52,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:50:52,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:50:52,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:52,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:52,321 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:50:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218400497] [2025-01-09 05:50:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218400497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:52,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:52,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:50:52,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470648596] [2025-01-09 05:50:52,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:52,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:50:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:52,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:50:52,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:50:52,323 INFO L87 Difference]: Start difference. First operand 1699 states and 3057 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:52,351 INFO L93 Difference]: Finished difference Result 1869 states and 3318 transitions. [2025-01-09 05:50:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:50:52,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 05:50:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:52,358 INFO L225 Difference]: With dead ends: 1869 [2025-01-09 05:50:52,358 INFO L226 Difference]: Without dead ends: 1781 [2025-01-09 05:50:52,358 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:50:52,359 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1496 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1663 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:50:52,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:50:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-01-09 05:50:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1779. [2025-01-09 05:50:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1777 states have (on average 1.7884074282498592) internal successors, (3178), 1778 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 3178 transitions. [2025-01-09 05:50:52,395 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 3178 transitions. Word has length 58 [2025-01-09 05:50:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:52,395 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 3178 transitions. [2025-01-09 05:50:52,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 3178 transitions. [2025-01-09 05:50:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:50:52,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:52,396 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] [2025-01-09 05:50:52,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:50:52,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:52,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1637992962, now seen corresponding path program 1 times [2025-01-09 05:50:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:52,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551590687] [2025-01-09 05:50:52,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:52,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:52,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:50:52,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:50:52,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:52,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:52,440 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:50:52,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:52,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551590687] [2025-01-09 05:50:52,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551590687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:52,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:52,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:50:52,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550577086] [2025-01-09 05:50:52,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:52,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:50:52,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:52,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:50:52,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:50:52,441 INFO L87 Difference]: Start difference. First operand 1779 states and 3178 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:52,470 INFO L93 Difference]: Finished difference Result 2225 states and 3858 transitions. [2025-01-09 05:50:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:50:52,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 05:50:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:52,477 INFO L225 Difference]: With dead ends: 2225 [2025-01-09 05:50:52,477 INFO L226 Difference]: Without dead ends: 1990 [2025-01-09 05:50:52,478 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:50:52,479 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 1494 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1669 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:50:52,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:50:52,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2025-01-09 05:50:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1988. [2025-01-09 05:50:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1986 states have (on average 1.75730110775428) internal successors, (3490), 1987 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 3490 transitions. [2025-01-09 05:50:52,520 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 3490 transitions. Word has length 58 [2025-01-09 05:50:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:52,520 INFO L471 AbstractCegarLoop]: Abstraction has 1988 states and 3490 transitions. [2025-01-09 05:50:52,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 3490 transitions. [2025-01-09 05:50:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:50:52,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:52,521 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] [2025-01-09 05:50:52,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:50:52,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1418712318, now seen corresponding path program 1 times [2025-01-09 05:50:52,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:52,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44994200] [2025-01-09 05:50:52,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:52,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:52,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:50:52,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:50:52,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:52,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:52,567 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:50:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44994200] [2025-01-09 05:50:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44994200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:52,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:50:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407838642] [2025-01-09 05:50:52,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:52,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:50:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:52,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:50:52,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:50:52,568 INFO L87 Difference]: Start difference. First operand 1988 states and 3490 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:52,600 INFO L93 Difference]: Finished difference Result 2828 states and 4752 transitions. [2025-01-09 05:50:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:50:52,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 05:50:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:52,608 INFO L225 Difference]: With dead ends: 2828 [2025-01-09 05:50:52,608 INFO L226 Difference]: Without dead ends: 2384 [2025-01-09 05:50:52,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:50:52,609 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1492 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1671 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:50:52,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1671 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:50:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2025-01-09 05:50:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2382. [2025-01-09 05:50:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2380 states have (on average 1.7084033613445377) internal successors, (4066), 2381 states have internal predecessors, (4066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 4066 transitions. [2025-01-09 05:50:52,657 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 4066 transitions. Word has length 58 [2025-01-09 05:50:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:52,657 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 4066 transitions. [2025-01-09 05:50:52,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 4066 transitions. [2025-01-09 05:50:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:50:52,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:52,658 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] [2025-01-09 05:50:52,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:50:52,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:52,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1853248254, now seen corresponding path program 1 times [2025-01-09 05:50:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:52,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702542953] [2025-01-09 05:50:52,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:52,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:50:52,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:50:52,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:52,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:52,699 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:50:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702542953] [2025-01-09 05:50:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702542953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:52,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:52,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:50:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974416742] [2025-01-09 05:50:52,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:52,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:50:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:52,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:50:52,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:50:52,701 INFO L87 Difference]: Start difference. First operand 2382 states and 4066 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:52,741 INFO L93 Difference]: Finished difference Result 3962 states and 6396 transitions. [2025-01-09 05:50:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:50:52,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 05:50:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:52,751 INFO L225 Difference]: With dead ends: 3962 [2025-01-09 05:50:52,751 INFO L226 Difference]: Without dead ends: 3124 [2025-01-09 05:50:52,753 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:50:52,754 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 1488 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1667 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:50:52,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1667 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:50:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2025-01-09 05:50:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3122. [2025-01-09 05:50:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3120 states have (on average 1.6416666666666666) internal successors, (5122), 3121 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5122 transitions. [2025-01-09 05:50:52,996 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5122 transitions. Word has length 58 [2025-01-09 05:50:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:52,996 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 5122 transitions. [2025-01-09 05:50:52,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5122 transitions. [2025-01-09 05:50:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:50:53,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:53,005 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] [2025-01-09 05:50:53,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:50:53,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:53,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:53,006 INFO L85 PathProgramCache]: Analyzing trace with hash 660786178, now seen corresponding path program 1 times [2025-01-09 05:50:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:53,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404702521] [2025-01-09 05:50:53,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:53,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:50:53,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:50:53,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:53,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404702521] [2025-01-09 05:50:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404702521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:53,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:53,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:50:53,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675213921] [2025-01-09 05:50:53,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:53,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:50:53,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:53,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:50:53,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:50:53,057 INFO L87 Difference]: Start difference. First operand 3122 states and 5122 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:53,128 INFO L93 Difference]: Finished difference Result 6086 states and 9396 transitions. [2025-01-09 05:50:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:50:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 05:50:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:53,143 INFO L225 Difference]: With dead ends: 6086 [2025-01-09 05:50:53,143 INFO L226 Difference]: Without dead ends: 4508 [2025-01-09 05:50:53,146 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:50:53,147 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1490 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1673 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:50:53,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1673 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:50:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2025-01-09 05:50:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 4506. [2025-01-09 05:50:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 4504 states have (on average 1.5634991119005328) internal successors, (7042), 4505 states have internal predecessors, (7042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 7042 transitions. [2025-01-09 05:50:53,266 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 7042 transitions. Word has length 58 [2025-01-09 05:50:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:53,266 INFO L471 AbstractCegarLoop]: Abstraction has 4506 states and 7042 transitions. [2025-01-09 05:50:53,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 7042 transitions. [2025-01-09 05:50:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:50:53,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:53,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:50:53,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:50:53,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:53,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -255076291, now seen corresponding path program 1 times [2025-01-09 05:50:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633430467] [2025-01-09 05:50:53,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:53,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:50:53,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:50:53,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:53,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:53,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:53,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633430467] [2025-01-09 05:50:53,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633430467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:53,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:53,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:50:53,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566638687] [2025-01-09 05:50:53,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:53,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:50:53,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:53,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:50:53,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:50:53,460 INFO L87 Difference]: Start difference. First operand 4506 states and 7042 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:59,101 INFO L93 Difference]: Finished difference Result 8263 states and 13932 transitions. [2025-01-09 05:50:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:50:59,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 05:50:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:59,130 INFO L225 Difference]: With dead ends: 8263 [2025-01-09 05:50:59,130 INFO L226 Difference]: Without dead ends: 6759 [2025-01-09 05:50:59,137 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:50:59,137 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 2367 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4805 mSolverCounterSat, 1138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2367 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 5943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1138 IncrementalHoareTripleChecker+Valid, 4805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:59,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2367 Valid, 818 Invalid, 5943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1138 Valid, 4805 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 05:50:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6759 states. [2025-01-09 05:50:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6759 to 6759. [2025-01-09 05:50:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6759 states, 6757 states have (on average 1.4253366878792364) internal successors, (9631), 6758 states have internal predecessors, (9631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6759 states to 6759 states and 9631 transitions. [2025-01-09 05:50:59,310 INFO L78 Accepts]: Start accepts. Automaton has 6759 states and 9631 transitions. Word has length 76 [2025-01-09 05:50:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:59,311 INFO L471 AbstractCegarLoop]: Abstraction has 6759 states and 9631 transitions. [2025-01-09 05:50:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 6759 states and 9631 transitions. [2025-01-09 05:50:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:50:59,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:59,313 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] [2025-01-09 05:50:59,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:50:59,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1461278301, now seen corresponding path program 1 times [2025-01-09 05:50:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458514259] [2025-01-09 05:50:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:59,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:50:59,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:50:59,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:59,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:50:59,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:59,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458514259] [2025-01-09 05:50:59,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458514259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:50:59,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:50:59,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:50:59,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392508198] [2025-01-09 05:50:59,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:50:59,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:50:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:59,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:50:59,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:50:59,452 INFO L87 Difference]: Start difference. First operand 6759 states and 9631 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:50:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:59,761 INFO L93 Difference]: Finished difference Result 21363 states and 30437 transitions. [2025-01-09 05:50:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:50:59,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 05:50:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:59,790 INFO L225 Difference]: With dead ends: 21363 [2025-01-09 05:50:59,790 INFO L226 Difference]: Without dead ends: 19249 [2025-01-09 05:50:59,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:50:59,799 INFO L435 NwaCegarLoop]: 1605 mSDtfsCounter, 6361 mSDsluCounter, 2046 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6361 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:59,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6361 Valid, 3651 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:50:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19249 states. [2025-01-09 05:51:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19249 to 9303. [2025-01-09 05:51:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9303 states, 9301 states have (on average 1.4208149661326739) internal successors, (13215), 9302 states have internal predecessors, (13215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9303 states to 9303 states and 13215 transitions. [2025-01-09 05:51:00,068 INFO L78 Accepts]: Start accepts. Automaton has 9303 states and 13215 transitions. Word has length 77 [2025-01-09 05:51:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:00,068 INFO L471 AbstractCegarLoop]: Abstraction has 9303 states and 13215 transitions. [2025-01-09 05:51:00,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 9303 states and 13215 transitions. [2025-01-09 05:51:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:51:00,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:00,070 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] [2025-01-09 05:51:00,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:51:00,070 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:00,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1725134685, now seen corresponding path program 1 times [2025-01-09 05:51:00,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:00,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546637409] [2025-01-09 05:51:00,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:00,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:51:00,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:51:00,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:00,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:51:00,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:00,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546637409] [2025-01-09 05:51:00,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546637409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:00,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:00,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:51:00,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689300741] [2025-01-09 05:51:00,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:00,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:51:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:00,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:51:00,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:51:00,189 INFO L87 Difference]: Start difference. First operand 9303 states and 13215 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:00,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:00,728 INFO L93 Difference]: Finished difference Result 24323 states and 34629 transitions. [2025-01-09 05:51:00,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:51:00,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 05:51:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:00,785 INFO L225 Difference]: With dead ends: 24323 [2025-01-09 05:51:00,785 INFO L226 Difference]: Without dead ends: 21361 [2025-01-09 05:51:00,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:51:00,792 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6361 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6361 SdHoareTripleChecker+Valid, 3640 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:51:00,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6361 Valid, 3640 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:51:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21361 states. [2025-01-09 05:51:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21361 to 13319. [2025-01-09 05:51:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13319 states, 13317 states have (on average 1.4164601637005332) internal successors, (18863), 13318 states have internal predecessors, (18863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 18863 transitions. [2025-01-09 05:51:01,157 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 18863 transitions. Word has length 77 [2025-01-09 05:51:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:01,198 INFO L471 AbstractCegarLoop]: Abstraction has 13319 states and 18863 transitions. [2025-01-09 05:51:01,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 18863 transitions. [2025-01-09 05:51:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:51:01,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:01,200 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] [2025-01-09 05:51:01,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:51:01,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:01,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1331570595, now seen corresponding path program 1 times [2025-01-09 05:51:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:01,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573890364] [2025-01-09 05:51:01,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:01,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:51:01,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:51:01,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:01,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:51:01,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:01,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573890364] [2025-01-09 05:51:01,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573890364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:01,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:01,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:51:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763156680] [2025-01-09 05:51:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:01,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:51:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:01,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:51:01,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:51:01,327 INFO L87 Difference]: Start difference. First operand 13319 states and 18863 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:01,707 INFO L93 Difference]: Finished difference Result 27283 states and 38805 transitions. [2025-01-09 05:51:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:51:01,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 05:51:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:01,744 INFO L225 Difference]: With dead ends: 27283 [2025-01-09 05:51:01,744 INFO L226 Difference]: Without dead ends: 24321 [2025-01-09 05:51:01,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:51:01,752 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 6401 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6401 SdHoareTripleChecker+Valid, 3606 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:51:01,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6401 Valid, 3606 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:51:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24321 states. [2025-01-09 05:51:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24321 to 16279. [2025-01-09 05:51:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16279 states, 16277 states have (on average 1.4154328193155987) internal successors, (23039), 16278 states have internal predecessors, (23039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16279 states to 16279 states and 23039 transitions. [2025-01-09 05:51:02,163 INFO L78 Accepts]: Start accepts. Automaton has 16279 states and 23039 transitions. Word has length 77 [2025-01-09 05:51:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:02,167 INFO L471 AbstractCegarLoop]: Abstraction has 16279 states and 23039 transitions. [2025-01-09 05:51:02,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 16279 states and 23039 transitions. [2025-01-09 05:51:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:51:02,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:02,169 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] [2025-01-09 05:51:02,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:51:02,169 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:02,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1766106531, now seen corresponding path program 1 times [2025-01-09 05:51:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705543714] [2025-01-09 05:51:02,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:02,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:02,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:51:02,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:51:02,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:02,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:51:02,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:02,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705543714] [2025-01-09 05:51:02,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705543714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:02,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:02,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:51:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816477736] [2025-01-09 05:51:02,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:02,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:51:02,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:02,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:51:02,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:51:02,354 INFO L87 Difference]: Start difference. First operand 16279 states and 23039 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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:51:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:02,830 INFO L93 Difference]: Finished difference Result 30243 states and 42981 transitions. [2025-01-09 05:51:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:51:02,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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 77 [2025-01-09 05:51:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:02,873 INFO L225 Difference]: With dead ends: 30243 [2025-01-09 05:51:02,873 INFO L226 Difference]: Without dead ends: 27281 [2025-01-09 05:51:02,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:51:02,882 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 6375 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6375 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:51:02,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6375 Valid, 3625 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:51:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27281 states. [2025-01-09 05:51:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27281 to 19239. [2025-01-09 05:51:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19239 states, 19237 states have (on average 1.414721630191818) internal successors, (27215), 19238 states have internal predecessors, (27215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19239 states to 19239 states and 27215 transitions. [2025-01-09 05:51:03,269 INFO L78 Accepts]: Start accepts. Automaton has 19239 states and 27215 transitions. Word has length 77 [2025-01-09 05:51:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:03,270 INFO L471 AbstractCegarLoop]: Abstraction has 19239 states and 27215 transitions. [2025-01-09 05:51:03,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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:51:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 19239 states and 27215 transitions. [2025-01-09 05:51:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:51:03,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:03,273 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] [2025-01-09 05:51:03,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:51:03,273 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:03,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash 747927901, now seen corresponding path program 1 times [2025-01-09 05:51:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:03,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074131850] [2025-01-09 05:51:03,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:03,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:51:03,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:51:03,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:03,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:51:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074131850] [2025-01-09 05:51:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074131850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:03,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:03,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:51:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982946378] [2025-01-09 05:51:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:03,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:51:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:03,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:51:03,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:51:03,650 INFO L87 Difference]: Start difference. First operand 19239 states and 27215 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:04,234 INFO L93 Difference]: Finished difference Result 33203 states and 47157 transitions. [2025-01-09 05:51:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:51:04,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 05:51:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:04,267 INFO L225 Difference]: With dead ends: 33203 [2025-01-09 05:51:04,267 INFO L226 Difference]: Without dead ends: 30241 [2025-01-09 05:51:04,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:51:04,275 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6319 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6319 SdHoareTripleChecker+Valid, 3690 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:51:04,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6319 Valid, 3690 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:51:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30241 states. [2025-01-09 05:51:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30241 to 22199. [2025-01-09 05:51:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22199 states, 22197 states have (on average 1.414200117132946) internal successors, (31391), 22198 states have internal predecessors, (31391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22199 states to 22199 states and 31391 transitions. [2025-01-09 05:51:04,743 INFO L78 Accepts]: Start accepts. Automaton has 22199 states and 31391 transitions. Word has length 77 [2025-01-09 05:51:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:04,743 INFO L471 AbstractCegarLoop]: Abstraction has 22199 states and 31391 transitions. [2025-01-09 05:51:04,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 22199 states and 31391 transitions. [2025-01-09 05:51:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:51:04,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:04,746 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] [2025-01-09 05:51:04,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:51:04,747 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:04,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash -929626840, now seen corresponding path program 1 times [2025-01-09 05:51:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:04,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763561470] [2025-01-09 05:51:04,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:04,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:51:04,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:51:04,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:04,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:04,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:04,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763561470] [2025-01-09 05:51:04,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763561470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:04,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:04,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:51:04,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851326714] [2025-01-09 05:51:04,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:04,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:51:04,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:04,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:51:04,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:51:04,816 INFO L87 Difference]: Start difference. First operand 22199 states and 31391 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:05,308 INFO L93 Difference]: Finished difference Result 40603 states and 57377 transitions. [2025-01-09 05:51:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:51:05,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-01-09 05:51:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:05,332 INFO L225 Difference]: With dead ends: 40603 [2025-01-09 05:51:05,332 INFO L226 Difference]: Without dead ends: 22201 [2025-01-09 05:51:05,345 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:51:05,345 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 45 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3108 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:51:05,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:51:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22201 states. [2025-01-09 05:51:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22201 to 22199. [2025-01-09 05:51:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22199 states, 22197 states have (on average 1.400864981754291) internal successors, (31095), 22198 states have internal predecessors, (31095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22199 states to 22199 states and 31095 transitions. [2025-01-09 05:51:05,842 INFO L78 Accepts]: Start accepts. Automaton has 22199 states and 31095 transitions. Word has length 78 [2025-01-09 05:51:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:05,842 INFO L471 AbstractCegarLoop]: Abstraction has 22199 states and 31095 transitions. [2025-01-09 05:51:05,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 22199 states and 31095 transitions. [2025-01-09 05:51:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:51:05,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:05,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:51:05,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:51:05,845 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:05,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash -270097992, now seen corresponding path program 1 times [2025-01-09 05:51:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:05,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530801407] [2025-01-09 05:51:05,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:05,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:05,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:51:05,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:51:05,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:05,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:05,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:05,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530801407] [2025-01-09 05:51:05,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530801407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:05,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:05,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:51:05,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002223400] [2025-01-09 05:51:05,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:05,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:51:05,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:05,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:51:05,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:51:05,904 INFO L87 Difference]: Start difference. First operand 22199 states and 31095 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:09,488 INFO L93 Difference]: Finished difference Result 26707 states and 38478 transitions. [2025-01-09 05:51:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:51:09,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-01-09 05:51:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:09,515 INFO L225 Difference]: With dead ends: 26707 [2025-01-09 05:51:09,515 INFO L226 Difference]: Without dead ends: 23701 [2025-01-09 05:51:09,521 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:51:09,522 INFO L435 NwaCegarLoop]: 1074 mSDtfsCounter, 784 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:51:09,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1186 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 05:51:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23701 states. [2025-01-09 05:51:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23701 to 23701. [2025-01-09 05:51:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23701 states, 23699 states have (on average 1.412422465082915) internal successors, (33473), 23700 states have internal predecessors, (33473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23701 states to 23701 states and 33473 transitions. [2025-01-09 05:51:10,020 INFO L78 Accepts]: Start accepts. Automaton has 23701 states and 33473 transitions. Word has length 78 [2025-01-09 05:51:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:10,021 INFO L471 AbstractCegarLoop]: Abstraction has 23701 states and 33473 transitions. [2025-01-09 05:51:10,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 23701 states and 33473 transitions. [2025-01-09 05:51:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:51:10,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:10,023 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] [2025-01-09 05:51:10,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:51:10,024 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:10,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1352147403, now seen corresponding path program 1 times [2025-01-09 05:51:10,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:10,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584157591] [2025-01-09 05:51:10,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:10,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:10,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:51:10,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:51:10,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:10,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584157591] [2025-01-09 05:51:10,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584157591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:10,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:10,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:51:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65345949] [2025-01-09 05:51:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:10,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:51:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:10,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:51:10,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:51:10,160 INFO L87 Difference]: Start difference. First operand 23701 states and 33473 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:51:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:10,443 INFO L93 Difference]: Finished difference Result 30588 states and 43167 transitions. [2025-01-09 05:51:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:51:10,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 79 [2025-01-09 05:51:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:10,477 INFO L225 Difference]: With dead ends: 30588 [2025-01-09 05:51:10,480 INFO L226 Difference]: Without dead ends: 12186 [2025-01-09 05:51:10,510 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:51:10,513 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 39 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3105 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:51:10,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:51:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12186 states. [2025-01-09 05:51:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12186 to 12178. [2025-01-09 05:51:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12178 states, 12176 states have (on average 1.4262483574244416) internal successors, (17366), 12177 states have internal predecessors, (17366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 17366 transitions. [2025-01-09 05:51:10,977 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 17366 transitions. Word has length 79 [2025-01-09 05:51:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:10,980 INFO L471 AbstractCegarLoop]: Abstraction has 12178 states and 17366 transitions. [2025-01-09 05:51:10,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:51:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 17366 transitions. [2025-01-09 05:51:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 05:51:10,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:10,981 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] [2025-01-09 05:51:10,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:51:10,981 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:10,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1254292154, now seen corresponding path program 1 times [2025-01-09 05:51:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748039414] [2025-01-09 05:51:10,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:10,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 05:51:11,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 05:51:11,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:11,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748039414] [2025-01-09 05:51:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748039414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:11,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:11,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:51:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79021181] [2025-01-09 05:51:11,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:11,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:51:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:11,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:51:11,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:51:11,109 INFO L87 Difference]: Start difference. First operand 12178 states and 17366 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:11,262 INFO L93 Difference]: Finished difference Result 15614 states and 22152 transitions. [2025-01-09 05:51:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:51:11,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-01-09 05:51:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:11,279 INFO L225 Difference]: With dead ends: 15614 [2025-01-09 05:51:11,283 INFO L226 Difference]: Without dead ends: 8748 [2025-01-09 05:51:11,290 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:51:11,300 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 41 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3084 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:51:11,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3084 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:51:11,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8748 states. [2025-01-09 05:51:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8748 to 8746. [2025-01-09 05:51:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8746 states, 8744 states have (on average 1.4329826166514181) internal successors, (12530), 8745 states have internal predecessors, (12530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8746 states to 8746 states and 12530 transitions. [2025-01-09 05:51:11,522 INFO L78 Accepts]: Start accepts. Automaton has 8746 states and 12530 transitions. Word has length 80 [2025-01-09 05:51:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:11,522 INFO L471 AbstractCegarLoop]: Abstraction has 8746 states and 12530 transitions. [2025-01-09 05:51:11,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 8746 states and 12530 transitions. [2025-01-09 05:51:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 05:51:11,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:11,523 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] [2025-01-09 05:51:11,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:51:11,524 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:11,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1978584780, now seen corresponding path program 1 times [2025-01-09 05:51:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795026263] [2025-01-09 05:51:11,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:11,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 05:51:11,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 05:51:11,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:11,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795026263] [2025-01-09 05:51:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795026263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:11,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:51:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260229381] [2025-01-09 05:51:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:11,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:51:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:11,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:51:11,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:51:11,588 INFO L87 Difference]: Start difference. First operand 8746 states and 12530 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:11,637 INFO L93 Difference]: Finished difference Result 10466 states and 14898 transitions. [2025-01-09 05:51:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:51:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 05:51:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:11,644 INFO L225 Difference]: With dead ends: 10466 [2025-01-09 05:51:11,644 INFO L226 Difference]: Without dead ends: 7032 [2025-01-09 05:51:11,648 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:51:11,650 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 38 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3069 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:51:11,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3069 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:51:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2025-01-09 05:51:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 7030. [2025-01-09 05:51:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7030 states, 7028 states have (on average 1.4425156516789983) internal successors, (10138), 7029 states have internal predecessors, (10138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 10138 transitions. [2025-01-09 05:51:11,787 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 10138 transitions. Word has length 82 [2025-01-09 05:51:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:11,788 INFO L471 AbstractCegarLoop]: Abstraction has 7030 states and 10138 transitions. [2025-01-09 05:51:11,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 10138 transitions. [2025-01-09 05:51:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 05:51:11,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:11,789 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] [2025-01-09 05:51:11,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:51:11,790 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:11,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1293918558, now seen corresponding path program 1 times [2025-01-09 05:51:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:11,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146453858] [2025-01-09 05:51:11,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:11,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 05:51:11,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 05:51:11,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:11,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146453858] [2025-01-09 05:51:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146453858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:51:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:51:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:51:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457545321] [2025-01-09 05:51:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:51:11,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:51:11,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:11,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:51:11,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:51:11,922 INFO L87 Difference]: Start difference. First operand 7030 states and 10138 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:12,017 INFO L93 Difference]: Finished difference Result 7892 states and 11310 transitions. [2025-01-09 05:51:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:51:12,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 05:51:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:12,029 INFO L225 Difference]: With dead ends: 7892 [2025-01-09 05:51:12,033 INFO L226 Difference]: Without dead ends: 6174 [2025-01-09 05:51:12,036 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:51:12,036 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 35 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3054 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:51:12,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3054 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:51:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2025-01-09 05:51:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 6172. [2025-01-09 05:51:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6172 states, 6170 states have (on average 1.4513776337115072) internal successors, (8955), 6171 states have internal predecessors, (8955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 8955 transitions. [2025-01-09 05:51:12,135 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 8955 transitions. Word has length 84 [2025-01-09 05:51:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:12,136 INFO L471 AbstractCegarLoop]: Abstraction has 6172 states and 8955 transitions. [2025-01-09 05:51:12,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 8955 transitions. [2025-01-09 05:51:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 05:51:12,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:12,137 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] [2025-01-09 05:51:12,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 05:51:12,137 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:12,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1472032144, now seen corresponding path program 1 times [2025-01-09 05:51:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:12,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579971398] [2025-01-09 05:51:12,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:12,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 05:51:12,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 05:51:12,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:12,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:13,364 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:51:13,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:13,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579971398] [2025-01-09 05:51:13,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579971398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:51:13,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677454361] [2025-01-09 05:51:13,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:13,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:51:13,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:51:13,367 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:51:13,369 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:51:13,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 05:51:13,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 05:51:13,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:13,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:13,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 05:51:13,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:51:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:13,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:51:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:14,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677454361] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:51:14,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:51:14,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-01-09 05:51:14,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870411418] [2025-01-09 05:51:14,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:51:14,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:51:14,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:14,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:51:14,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:51:14,197 INFO L87 Difference]: Start difference. First operand 6172 states and 8955 transitions. Second operand has 22 states, 22 states have (on average 11.136363636363637) internal successors, (245), 22 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:18,611 INFO L93 Difference]: Finished difference Result 12498 states and 17267 transitions. [2025-01-09 05:51:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-01-09 05:51:18,612 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.136363636363637) internal successors, (245), 22 states have internal predecessors, (245), 0 states have call successors, (0), 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 86 [2025-01-09 05:51:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:18,622 INFO L225 Difference]: With dead ends: 12498 [2025-01-09 05:51:18,623 INFO L226 Difference]: Without dead ends: 11560 [2025-01-09 05:51:18,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3139 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1601, Invalid=7329, Unknown=0, NotChecked=0, Total=8930 [2025-01-09 05:51:18,628 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 20545 mSDsluCounter, 6662 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20545 SdHoareTripleChecker+Valid, 8192 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:51:18,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20545 Valid, 8192 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 05:51:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11560 states. [2025-01-09 05:51:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11560 to 10898. [2025-01-09 05:51:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10898 states, 10896 states have (on average 1.3839023494860498) internal successors, (15079), 10897 states have internal predecessors, (15079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10898 states to 10898 states and 15079 transitions. [2025-01-09 05:51:18,936 INFO L78 Accepts]: Start accepts. Automaton has 10898 states and 15079 transitions. Word has length 86 [2025-01-09 05:51:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:18,936 INFO L471 AbstractCegarLoop]: Abstraction has 10898 states and 15079 transitions. [2025-01-09 05:51:18,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.136363636363637) internal successors, (245), 22 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 10898 states and 15079 transitions. [2025-01-09 05:51:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 05:51:18,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:18,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:51:18,948 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:51:19,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 05:51:19,142 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:19,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash 283374943, now seen corresponding path program 1 times [2025-01-09 05:51:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:19,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129492275] [2025-01-09 05:51:19,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:19,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:19,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 05:51:19,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 05:51:19,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:19,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:19,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129492275] [2025-01-09 05:51:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129492275] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:51:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963931045] [2025-01-09 05:51:19,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:19,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:51:19,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:51:19,394 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:51:19,395 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:51:19,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 05:51:19,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 05:51:19,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:19,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:19,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 05:51:19,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:51:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:19,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:51:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:20,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963931045] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:51:20,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:51:20,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2025-01-09 05:51:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192662000] [2025-01-09 05:51:20,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:51:20,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 05:51:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:20,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 05:51:20,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-01-09 05:51:20,972 INFO L87 Difference]: Start difference. First operand 10898 states and 15079 transitions. Second operand has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:23,439 INFO L93 Difference]: Finished difference Result 25613 states and 34336 transitions. [2025-01-09 05:51:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 05:51:23,439 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 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 87 [2025-01-09 05:51:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:23,456 INFO L225 Difference]: With dead ends: 25613 [2025-01-09 05:51:23,457 INFO L226 Difference]: Without dead ends: 20203 [2025-01-09 05:51:23,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=725, Invalid=2935, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 05:51:23,461 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 20271 mSDsluCounter, 8053 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20271 SdHoareTripleChecker+Valid, 9554 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:51:23,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20271 Valid, 9554 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:51:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20203 states. [2025-01-09 05:51:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20203 to 20121. [2025-01-09 05:51:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20121 states, 20119 states have (on average 1.3331179482081614) internal successors, (26821), 20120 states have internal predecessors, (26821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20121 states to 20121 states and 26821 transitions. [2025-01-09 05:51:24,240 INFO L78 Accepts]: Start accepts. Automaton has 20121 states and 26821 transitions. Word has length 87 [2025-01-09 05:51:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:24,241 INFO L471 AbstractCegarLoop]: Abstraction has 20121 states and 26821 transitions. [2025-01-09 05:51:24,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 20121 states and 26821 transitions. [2025-01-09 05:51:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 05:51:24,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:24,247 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:51:24,266 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:51:24,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:51:24,448 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:24,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:24,451 INFO L85 PathProgramCache]: Analyzing trace with hash -373213857, now seen corresponding path program 1 times [2025-01-09 05:51:24,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:24,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451447445] [2025-01-09 05:51:24,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:24,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 05:51:24,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 05:51:24,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:24,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:24,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451447445] [2025-01-09 05:51:24,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451447445] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:51:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540593282] [2025-01-09 05:51:24,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:24,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:51:24,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:51:24,948 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:51:24,949 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:51:25,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 05:51:25,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 05:51:25,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:25,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:25,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 05:51:25,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:51:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:25,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:51:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540593282] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:51:26,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:51:26,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-01-09 05:51:26,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050433487] [2025-01-09 05:51:26,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:51:26,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:51:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:26,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:51:26,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:51:26,151 INFO L87 Difference]: Start difference. First operand 20121 states and 26821 transitions. Second operand has 29 states, 29 states have (on average 7.344827586206897) internal successors, (213), 29 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:27,035 INFO L93 Difference]: Finished difference Result 35137 states and 46237 transitions. [2025-01-09 05:51:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 05:51:27,036 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.344827586206897) internal successors, (213), 29 states have internal predecessors, (213), 0 states have call successors, (0), 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 87 [2025-01-09 05:51:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:27,056 INFO L225 Difference]: With dead ends: 35137 [2025-01-09 05:51:27,057 INFO L226 Difference]: Without dead ends: 20713 [2025-01-09 05:51:27,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=1196, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 05:51:27,066 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 9353 mSDsluCounter, 6554 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9353 SdHoareTripleChecker+Valid, 8089 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:51:27,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9353 Valid, 8089 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:51:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20713 states. [2025-01-09 05:51:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20713 to 20409. [2025-01-09 05:51:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20409 states, 20407 states have (on average 1.3230754152986721) internal successors, (27000), 20408 states have internal predecessors, (27000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20409 states to 20409 states and 27000 transitions. [2025-01-09 05:51:27,536 INFO L78 Accepts]: Start accepts. Automaton has 20409 states and 27000 transitions. Word has length 87 [2025-01-09 05:51:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:27,536 INFO L471 AbstractCegarLoop]: Abstraction has 20409 states and 27000 transitions. [2025-01-09 05:51:27,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.344827586206897) internal successors, (213), 29 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 20409 states and 27000 transitions. [2025-01-09 05:51:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 05:51:27,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:27,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:51:27,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 05:51:27,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:51:27,783 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:27,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:27,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2057702158, now seen corresponding path program 1 times [2025-01-09 05:51:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223787839] [2025-01-09 05:51:27,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:27,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:27,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 05:51:27,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 05:51:27,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:27,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:28,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:28,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223787839] [2025-01-09 05:51:28,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223787839] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:51:28,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343936710] [2025-01-09 05:51:28,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:28,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:51:28,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:51:28,330 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:51:28,338 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:51:28,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 05:51:28,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 05:51:28,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:28,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:28,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:51:28,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:51:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:28,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:51:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343936710] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:51:29,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:51:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:51:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300465910] [2025-01-09 05:51:29,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:51:29,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:51:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:51:29,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:51:29,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:51:29,385 INFO L87 Difference]: Start difference. First operand 20409 states and 27000 transitions. Second operand has 21 states, 21 states have (on average 9.476190476190476) internal successors, (199), 20 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:51:30,505 INFO L93 Difference]: Finished difference Result 49786 states and 64594 transitions. [2025-01-09 05:51:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:51:30,506 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.476190476190476) internal successors, (199), 20 states have internal predecessors, (199), 0 states have call successors, (0), 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 88 [2025-01-09 05:51:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:51:30,546 INFO L225 Difference]: With dead ends: 49786 [2025-01-09 05:51:30,547 INFO L226 Difference]: Without dead ends: 36217 [2025-01-09 05:51:30,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-01-09 05:51:30,561 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 10687 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10687 SdHoareTripleChecker+Valid, 4686 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:51:30,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10687 Valid, 4686 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:51:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36217 states. [2025-01-09 05:51:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36217 to 35821. [2025-01-09 05:51:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35821 states, 35819 states have (on average 1.2886736089784752) internal successors, (46159), 35820 states have internal predecessors, (46159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35821 states to 35821 states and 46159 transitions. [2025-01-09 05:51:31,815 INFO L78 Accepts]: Start accepts. Automaton has 35821 states and 46159 transitions. Word has length 88 [2025-01-09 05:51:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:51:31,815 INFO L471 AbstractCegarLoop]: Abstraction has 35821 states and 46159 transitions. [2025-01-09 05:51:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.476190476190476) internal successors, (199), 20 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:51:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 35821 states and 46159 transitions. [2025-01-09 05:51:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:51:31,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:51:31,821 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:51:31,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 05:51:32,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 05:51:32,021 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:51:32,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:51:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1922847535, now seen corresponding path program 1 times [2025-01-09 05:51:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:51:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180469383] [2025-01-09 05:51:32,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:51:32,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:51:32,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:51:32,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:32,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:51:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:51:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180469383] [2025-01-09 05:51:32,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180469383] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:51:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889079805] [2025-01-09 05:51:32,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:51:32,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:51:32,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:51:32,250 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:51:32,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:51:32,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:51:32,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:51:32,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:51:32,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:51:32,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 05:51:32,391 INFO L279 TraceCheckSpWp]: Computing forward predicates...