./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6cb8ee599d957b44e84b6deda03837f10d12ce4870b06e5310d491ec68c724f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:08:53,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:08:53,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:08:53,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:08:53,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:08:53,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:08:53,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:08:53,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:08:53,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:08:53,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:08:53,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:08:53,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:08:53,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:08:53,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:08:53,246 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:08:53,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:08:53,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:08:53,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:08:53,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:08:53,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:08:53,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:08:53,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:08:53,248 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/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 -> 6cb8ee599d957b44e84b6deda03837f10d12ce4870b06e5310d491ec68c724f7 [2025-03-03 16:08:53,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:08:53,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:08:53,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:08:53,459 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:08:53,459 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:08:53,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c [2025-03-03 16:08:54,555 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed35d519/e529b48d26e44911a836527b1b5cfc49/FLAGf06c42e80 [2025-03-03 16:08:54,930 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:08:54,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c [2025-03-03 16:08:54,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed35d519/e529b48d26e44911a836527b1b5cfc49/FLAGf06c42e80 [2025-03-03 16:08:55,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed35d519/e529b48d26e44911a836527b1b5cfc49 [2025-03-03 16:08:55,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:08:55,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:08:55,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:08:55,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:08:55,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:08:55,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:08:55" (1/1) ... [2025-03-03 16:08:55,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628e4a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:55, skipping insertion in model container [2025-03-03 16:08:55,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:08:55" (1/1) ... [2025-03-03 16:08:55,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:08:55,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c[11640,11653] [2025-03-03 16:08:55,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c[13977,13990] [2025-03-03 16:08:55,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:08:55,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:08:55,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c[11640,11653] [2025-03-03 16:08:55,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c[13977,13990] [2025-03-03 16:08:56,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:08:56,245 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:08:56,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56 WrapperNode [2025-03-03 16:08:56,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:08:56,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:08:56,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:08:56,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:08:56,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,515 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5093 [2025-03-03 16:08:56,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:08:56,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:08:56,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:08:56,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:08:56,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,674 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-03-03 16:08:56,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:08:56,916 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:08:56,916 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:08:56,916 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:08:56,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (1/1) ... [2025-03-03 16:08:56,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:08:56,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:08:56,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:08:56,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:08:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:08:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:08:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:08:56,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:08:57,034 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:08:57,036 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:09:00,289 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: havoc calculate_output_#t~ret38#1; [2025-03-03 16:09:00,289 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3606: havoc calculate_output2_#t~ret39#1; [2025-03-03 16:09:00,289 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5096: havoc calculate_output3_#t~ret40#1; [2025-03-03 16:09:00,423 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-03-03 16:09:00,424 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:09:00,458 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:09:00,460 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:09:00,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:09:00 BoogieIcfgContainer [2025-03-03 16:09:00,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:09:00,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:09:00,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:09:00,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:09:00,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:08:55" (1/3) ... [2025-03-03 16:09:00,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79129ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:09:00, skipping insertion in model container [2025-03-03 16:09:00,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:56" (2/3) ... [2025-03-03 16:09:00,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79129ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:09:00, skipping insertion in model container [2025-03-03 16:09:00,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:09:00" (3/3) ... [2025-03-03 16:09:00,467 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c [2025-03-03 16:09:00,477 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:09:00,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c that has 1 procedures, 898 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:09:00,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:09:00,556 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;@646ae9c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:09:00,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:09:00,564 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-03-03 16:09:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:09:00,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:00,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:00,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:00,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1651450810, now seen corresponding path program 1 times [2025-03-03 16:09:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233342995] [2025-03-03 16:09:00,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:00,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:00,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:09:00,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:09:00,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:00,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233342995] [2025-03-03 16:09:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233342995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:09:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638050439] [2025-03-03 16:09:00,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:00,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:00,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:00,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:00,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:00,844 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 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:03,463 INFO L93 Difference]: Finished difference Result 2514 states and 4839 transitions. [2025-03-03 16:09:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:03,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 16:09:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:03,481 INFO L225 Difference]: With dead ends: 2514 [2025-03-03 16:09:03,481 INFO L226 Difference]: Without dead ends: 1584 [2025-03-03 16:09:03,485 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-03-03 16:09:03,486 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 1015 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:03,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 295 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 16:09:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-03-03 16:09:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2025-03-03 16:09:03,563 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-03-03 16:09:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2913 transitions. [2025-03-03 16:09:03,574 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2913 transitions. Word has length 20 [2025-03-03 16:09:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:03,574 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2913 transitions. [2025-03-03 16:09:03,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2913 transitions. [2025-03-03 16:09:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:09:03,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:03,576 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-03-03 16:09:03,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:09:03,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:03,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2127528368, now seen corresponding path program 1 times [2025-03-03 16:09:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:03,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815645288] [2025-03-03 16:09:03,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:03,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:09:03,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:09:03,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:03,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:03,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:03,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815645288] [2025-03-03 16:09:03,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815645288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:03,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:03,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:09:03,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493352266] [2025-03-03 16:09:03,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:03,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:09:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:03,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:09:03,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:09:03,771 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-03-03 16:09:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:03,819 INFO L93 Difference]: Finished difference Result 1630 states and 2984 transitions. [2025-03-03 16:09:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:09:03,824 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-03-03 16:09:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:03,829 INFO L225 Difference]: With dead ends: 1630 [2025-03-03 16:09:03,829 INFO L226 Difference]: Without dead ends: 1584 [2025-03-03 16:09:03,829 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-03-03 16:09:03,830 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-03-03 16:09:03,831 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-03-03 16:09:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-03-03 16:09:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2025-03-03 16:09:03,853 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-03-03 16:09:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2882 transitions. [2025-03-03 16:09:03,857 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2882 transitions. Word has length 24 [2025-03-03 16:09:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:03,858 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2882 transitions. [2025-03-03 16:09:03,858 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-03-03 16:09:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2882 transitions. [2025-03-03 16:09:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:09:03,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:03,859 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-03-03 16:09:03,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:09:03,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:03,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash -130168238, now seen corresponding path program 1 times [2025-03-03 16:09:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71679325] [2025-03-03 16:09:03,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:03,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:09:03,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:09:03,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:03,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:04,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71679325] [2025-03-03 16:09:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71679325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:04,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:04,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396486633] [2025-03-03 16:09:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:04,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:04,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:04,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:04,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:04,071 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-03-03 16:09:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:04,267 INFO L93 Difference]: Finished difference Result 2004 states and 3552 transitions. [2025-03-03 16:09:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 16:09:04,267 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-03-03 16:09:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:04,274 INFO L225 Difference]: With dead ends: 2004 [2025-03-03 16:09:04,274 INFO L226 Difference]: Without dead ends: 1962 [2025-03-03 16:09:04,275 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-03-03 16:09:04,275 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 7898 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7898 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:04,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7898 Valid, 2999 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-03 16:09:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1624. [2025-03-03 16:09:04,303 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-03-03 16:09:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2946 transitions. [2025-03-03 16:09:04,309 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2946 transitions. Word has length 54 [2025-03-03 16:09:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:04,309 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2946 transitions. [2025-03-03 16:09:04,309 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-03-03 16:09:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2946 transitions. [2025-03-03 16:09:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:09:04,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:04,310 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-03-03 16:09:04,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:09:04,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 582728109, now seen corresponding path program 1 times [2025-03-03 16:09:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:04,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897862489] [2025-03-03 16:09:04,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:04,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:09:04,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:09:04,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:04,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897862489] [2025-03-03 16:09:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897862489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:04,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:04,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533656721] [2025-03-03 16:09:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:04,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:04,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:04,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:04,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:04,388 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-03-03 16:09:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:04,415 INFO L93 Difference]: Finished difference Result 1777 states and 3189 transitions. [2025-03-03 16:09:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:04,415 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-03-03 16:09:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:04,421 INFO L225 Difference]: With dead ends: 1777 [2025-03-03 16:09:04,421 INFO L226 Difference]: Without dead ends: 1695 [2025-03-03 16:09:04,422 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-03-03 16:09:04,425 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-03-03 16:09:04,425 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-03-03 16:09:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-03 16:09:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2025-03-03 16:09:04,451 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-03-03 16:09:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3054 transitions. [2025-03-03 16:09:04,457 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3054 transitions. Word has length 56 [2025-03-03 16:09:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:04,457 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 3054 transitions. [2025-03-03 16:09:04,458 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-03-03 16:09:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3054 transitions. [2025-03-03 16:09:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:09:04,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:04,460 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-03-03 16:09:04,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:09:04,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:04,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash 615051344, now seen corresponding path program 1 times [2025-03-03 16:09:04,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:04,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967256653] [2025-03-03 16:09:04,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:04,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:04,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:09:04,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:09:04,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:04,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:04,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:04,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967256653] [2025-03-03 16:09:04,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967256653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:04,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:04,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:04,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54057105] [2025-03-03 16:09:04,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:04,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:04,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:04,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:04,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:04,727 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-03-03 16:09:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:04,859 INFO L93 Difference]: Finished difference Result 1846 states and 3294 transitions. [2025-03-03 16:09:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:04,860 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-03-03 16:09:04,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:04,866 INFO L225 Difference]: With dead ends: 1846 [2025-03-03 16:09:04,866 INFO L226 Difference]: Without dead ends: 1695 [2025-03-03 16:09:04,867 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-03-03 16:09:04,868 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-03-03 16:09:04,868 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-03-03 16:09:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-03 16:09:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2025-03-03 16:09:04,892 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-03-03 16:09:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3052 transitions. [2025-03-03 16:09:04,897 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3052 transitions. Word has length 56 [2025-03-03 16:09:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:04,898 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 3052 transitions. [2025-03-03 16:09:04,898 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-03-03 16:09:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3052 transitions. [2025-03-03 16:09:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:09:04,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:04,900 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-03-03 16:09:04,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:09:04,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:04,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:04,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1917260214, now seen corresponding path program 1 times [2025-03-03 16:09:04,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:04,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599242499] [2025-03-03 16:09:04,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:04,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:09:04,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:09:04,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:04,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:05,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599242499] [2025-03-03 16:09:05,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599242499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:05,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:05,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:09:05,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18100231] [2025-03-03 16:09:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:05,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:09:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:05,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:09:05,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:09:05,128 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-03-03 16:09:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:05,187 INFO L93 Difference]: Finished difference Result 1701 states and 3061 transitions. [2025-03-03 16:09:05,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:09:05,187 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-03-03 16:09:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:05,194 INFO L225 Difference]: With dead ends: 1701 [2025-03-03 16:09:05,194 INFO L226 Difference]: Without dead ends: 1699 [2025-03-03 16:09:05,195 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-03-03 16:09:05,196 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-03-03 16:09:05,196 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-03-03 16:09:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-03-03 16:09:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2025-03-03 16:09:05,222 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-03-03 16:09:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3057 transitions. [2025-03-03 16:09:05,228 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3057 transitions. Word has length 57 [2025-03-03 16:09:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:05,229 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 3057 transitions. [2025-03-03 16:09:05,229 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-03-03 16:09:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3057 transitions. [2025-03-03 16:09:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:05,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:05,229 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-03-03 16:09:05,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:09:05,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:05,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1309029714, now seen corresponding path program 1 times [2025-03-03 16:09:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:05,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628833128] [2025-03-03 16:09:05,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:05,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:05,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:05,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:05,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:05,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:05,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628833128] [2025-03-03 16:09:05,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628833128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:05,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:05,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:05,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228800963] [2025-03-03 16:09:05,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:05,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:05,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:05,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:05,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:05,283 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-03-03 16:09:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:05,306 INFO L93 Difference]: Finished difference Result 1869 states and 3318 transitions. [2025-03-03 16:09:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:05,307 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-03-03 16:09:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:05,312 INFO L225 Difference]: With dead ends: 1869 [2025-03-03 16:09:05,312 INFO L226 Difference]: Without dead ends: 1781 [2025-03-03 16:09:05,313 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-03-03 16:09:05,313 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-03-03 16:09:05,314 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-03-03 16:09:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-03 16:09:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1779. [2025-03-03 16:09:05,340 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-03-03 16:09:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 3178 transitions. [2025-03-03 16:09:05,345 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 3178 transitions. Word has length 58 [2025-03-03 16:09:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:05,346 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 3178 transitions. [2025-03-03 16:09:05,346 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-03-03 16:09:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 3178 transitions. [2025-03-03 16:09:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:05,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:05,346 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-03-03 16:09:05,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:09:05,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:05,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2007007086, now seen corresponding path program 1 times [2025-03-03 16:09:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700704314] [2025-03-03 16:09:05,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:05,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:05,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:05,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:05,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700704314] [2025-03-03 16:09:05,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700704314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:05,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:05,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52461796] [2025-03-03 16:09:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:05,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:05,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:05,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:05,392 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-03-03 16:09:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:05,416 INFO L93 Difference]: Finished difference Result 2225 states and 3858 transitions. [2025-03-03 16:09:05,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:05,416 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-03-03 16:09:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:05,423 INFO L225 Difference]: With dead ends: 2225 [2025-03-03 16:09:05,423 INFO L226 Difference]: Without dead ends: 1990 [2025-03-03 16:09:05,424 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-03-03 16:09:05,424 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-03-03 16:09:05,424 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-03-03 16:09:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2025-03-03 16:09:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1988. [2025-03-03 16:09:05,454 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-03-03 16:09:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 3490 transitions. [2025-03-03 16:09:05,461 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 3490 transitions. Word has length 58 [2025-03-03 16:09:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:05,461 INFO L471 AbstractCegarLoop]: Abstraction has 1988 states and 3490 transitions. [2025-03-03 16:09:05,461 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-03-03 16:09:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 3490 transitions. [2025-03-03 16:09:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:05,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:05,462 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-03-03 16:09:05,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:09:05,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1559061550, now seen corresponding path program 1 times [2025-03-03 16:09:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:05,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21727047] [2025-03-03 16:09:05,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:05,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:05,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:05,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:05,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:05,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21727047] [2025-03-03 16:09:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21727047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519346637] [2025-03-03 16:09:05,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:05,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:05,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:05,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:05,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:05,514 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-03-03 16:09:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:05,546 INFO L93 Difference]: Finished difference Result 2828 states and 4752 transitions. [2025-03-03 16:09:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:05,547 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-03-03 16:09:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:05,555 INFO L225 Difference]: With dead ends: 2828 [2025-03-03 16:09:05,555 INFO L226 Difference]: Without dead ends: 2384 [2025-03-03 16:09:05,557 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-03-03 16:09:05,558 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-03-03 16:09:05,558 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-03-03 16:09:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2025-03-03 16:09:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2382. [2025-03-03 16:09:05,599 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-03-03 16:09:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 4066 transitions. [2025-03-03 16:09:05,607 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 4066 transitions. Word has length 58 [2025-03-03 16:09:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:05,607 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 4066 transitions. [2025-03-03 16:09:05,607 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-03-03 16:09:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 4066 transitions. [2025-03-03 16:09:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:05,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:05,608 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-03-03 16:09:05,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:09:05,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:05,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237422, now seen corresponding path program 1 times [2025-03-03 16:09:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:05,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136896807] [2025-03-03 16:09:05,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:05,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:05,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:05,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:05,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:05,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:05,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:05,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136896807] [2025-03-03 16:09:05,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136896807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:05,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:05,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:05,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591714668] [2025-03-03 16:09:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:05,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:05,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:05,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:05,660 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-03-03 16:09:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:05,699 INFO L93 Difference]: Finished difference Result 3962 states and 6396 transitions. [2025-03-03 16:09:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:05,699 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-03-03 16:09:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:05,709 INFO L225 Difference]: With dead ends: 3962 [2025-03-03 16:09:05,709 INFO L226 Difference]: Without dead ends: 3124 [2025-03-03 16:09:05,710 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-03-03 16:09:05,711 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-03-03 16:09:05,711 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-03-03 16:09:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2025-03-03 16:09:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3122. [2025-03-03 16:09:05,766 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-03-03 16:09:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5122 transitions. [2025-03-03 16:09:05,821 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5122 transitions. Word has length 58 [2025-03-03 16:09:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:05,821 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 5122 transitions. [2025-03-03 16:09:05,821 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-03-03 16:09:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5122 transitions. [2025-03-03 16:09:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:05,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:05,822 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-03-03 16:09:05,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:09:05,822 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:05,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:05,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519150, now seen corresponding path program 1 times [2025-03-03 16:09:05,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:05,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709201172] [2025-03-03 16:09:05,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:05,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:05,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:05,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:05,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:05,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:05,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709201172] [2025-03-03 16:09:05,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709201172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:05,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460739505] [2025-03-03 16:09:05,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:05,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:05,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:05,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:05,871 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-03-03 16:09:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:05,920 INFO L93 Difference]: Finished difference Result 6086 states and 9396 transitions. [2025-03-03 16:09:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:05,920 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-03-03 16:09:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:05,939 INFO L225 Difference]: With dead ends: 6086 [2025-03-03 16:09:05,942 INFO L226 Difference]: Without dead ends: 4508 [2025-03-03 16:09:05,945 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-03-03 16:09:05,945 INFO L435 NwaCegarLoop]: 1591 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, 1675 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-03-03 16:09:05,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1675 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2025-03-03 16:09:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 4506. [2025-03-03 16:09:06,019 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-03-03 16:09:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 7042 transitions. [2025-03-03 16:09:06,031 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 7042 transitions. Word has length 58 [2025-03-03 16:09:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:06,031 INFO L471 AbstractCegarLoop]: Abstraction has 4506 states and 7042 transitions. [2025-03-03 16:09:06,031 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-03-03 16:09:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 7042 transitions. [2025-03-03 16:09:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:06,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:06,033 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-03-03 16:09:06,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:09:06,034 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:06,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash -926993275, now seen corresponding path program 1 times [2025-03-03 16:09:06,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:06,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242808808] [2025-03-03 16:09:06,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:06,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:06,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:06,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:06,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:06,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:09:06,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:06,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242808808] [2025-03-03 16:09:06,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242808808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:06,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:06,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:06,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358398505] [2025-03-03 16:09:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:06,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:06,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:06,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:06,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:06,159 INFO L87 Difference]: Start difference. First operand 4506 states and 7042 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-03-03 16:09:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:06,401 INFO L93 Difference]: Finished difference Result 19110 states and 27848 transitions. [2025-03-03 16:09:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:06,402 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-03-03 16:09:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:06,434 INFO L225 Difference]: With dead ends: 19110 [2025-03-03 16:09:06,434 INFO L226 Difference]: Without dead ends: 16996 [2025-03-03 16:09:06,441 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-03-03 16:09:06,442 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6307 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6307 SdHoareTripleChecker+Valid, 3694 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-03-03 16:09:06,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6307 Valid, 3694 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16996 states. [2025-03-03 16:09:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16996 to 7050. [2025-03-03 16:09:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7050 states, 7048 states have (on average 1.507661748013621) internal successors, (10626), 7049 states have internal predecessors, (10626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 10626 transitions. [2025-03-03 16:09:06,707 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 10626 transitions. Word has length 77 [2025-03-03 16:09:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:06,707 INFO L471 AbstractCegarLoop]: Abstraction has 7050 states and 10626 transitions. [2025-03-03 16:09:06,707 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-03-03 16:09:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 10626 transitions. [2025-03-03 16:09:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:06,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:06,710 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-03-03 16:09:06,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:09:06,710 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:06,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1905923771, now seen corresponding path program 1 times [2025-03-03 16:09:06,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:06,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641477662] [2025-03-03 16:09:06,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:06,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:06,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:06,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:06,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:06,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:09:06,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:06,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641477662] [2025-03-03 16:09:06,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641477662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:06,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:06,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:06,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083036295] [2025-03-03 16:09:06,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:06,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:06,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:06,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:06,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:06,860 INFO L87 Difference]: Start difference. First operand 7050 states and 10626 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-03-03 16:09:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:07,177 INFO L93 Difference]: Finished difference Result 22070 states and 32040 transitions. [2025-03-03 16:09:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:07,177 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-03-03 16:09:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:07,216 INFO L225 Difference]: With dead ends: 22070 [2025-03-03 16:09:07,217 INFO L226 Difference]: Without dead ends: 19108 [2025-03-03 16:09:07,227 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-03-03 16:09:07,228 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6309 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6309 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:07,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6309 Valid, 3665 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19108 states. [2025-03-03 16:09:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19108 to 11066. [2025-03-03 16:09:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11066 states, 11064 states have (on average 1.4708966015907448) internal successors, (16274), 11065 states have internal predecessors, (16274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 16274 transitions. [2025-03-03 16:09:07,525 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 16274 transitions. Word has length 77 [2025-03-03 16:09:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:07,526 INFO L471 AbstractCegarLoop]: Abstraction has 11066 states and 16274 transitions. [2025-03-03 16:09:07,526 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-03-03 16:09:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 16274 transitions. [2025-03-03 16:09:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:07,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:07,528 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-03-03 16:09:07,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:09:07,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:07,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:07,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1941097989, now seen corresponding path program 1 times [2025-03-03 16:09:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:07,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636483585] [2025-03-03 16:09:07,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:07,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:07,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:07,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:07,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:07,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:09:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636483585] [2025-03-03 16:09:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636483585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272112522] [2025-03-03 16:09:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:07,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:07,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:07,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:07,698 INFO L87 Difference]: Start difference. First operand 11066 states and 16274 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-03-03 16:09:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:08,101 INFO L93 Difference]: Finished difference Result 25030 states and 36216 transitions. [2025-03-03 16:09:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:08,101 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-03-03 16:09:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:08,147 INFO L225 Difference]: With dead ends: 25030 [2025-03-03 16:09:08,147 INFO L226 Difference]: Without dead ends: 22068 [2025-03-03 16:09:08,159 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-03-03 16:09:08,160 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6331 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6331 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:08,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6331 Valid, 3633 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22068 states. [2025-03-03 16:09:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22068 to 14026. [2025-03-03 16:09:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14026 states, 14024 states have (on average 1.4582144894466629) internal successors, (20450), 14025 states have internal predecessors, (20450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14026 states to 14026 states and 20450 transitions. [2025-03-03 16:09:08,602 INFO L78 Accepts]: Start accepts. Automaton has 14026 states and 20450 transitions. Word has length 77 [2025-03-03 16:09:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:08,602 INFO L471 AbstractCegarLoop]: Abstraction has 14026 states and 20450 transitions. [2025-03-03 16:09:08,602 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-03-03 16:09:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14026 states and 20450 transitions. [2025-03-03 16:09:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:08,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:08,605 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-03-03 16:09:08,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:09:08,605 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:08,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:08,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1938693435, now seen corresponding path program 1 times [2025-03-03 16:09:08,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:08,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542368488] [2025-03-03 16:09:08,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:08,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:08,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:08,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:08,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:08,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:09:08,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542368488] [2025-03-03 16:09:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542368488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:08,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:08,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:08,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931816742] [2025-03-03 16:09:08,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:08,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:08,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:08,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:08,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:08,717 INFO L87 Difference]: Start difference. First operand 14026 states and 20450 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-03-03 16:09:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:09,064 INFO L93 Difference]: Finished difference Result 27990 states and 40392 transitions. [2025-03-03 16:09:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:09,065 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-03-03 16:09:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:09,105 INFO L225 Difference]: With dead ends: 27990 [2025-03-03 16:09:09,105 INFO L226 Difference]: Without dead ends: 25028 [2025-03-03 16:09:09,114 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-03-03 16:09:09,115 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 6367 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6367 SdHoareTripleChecker+Valid, 3642 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:09,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6367 Valid, 3642 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25028 states. [2025-03-03 16:09:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25028 to 16986. [2025-03-03 16:09:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16986 states, 16984 states have (on average 1.4499528968440885) internal successors, (24626), 16985 states have internal predecessors, (24626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16986 states to 16986 states and 24626 transitions. [2025-03-03 16:09:09,449 INFO L78 Accepts]: Start accepts. Automaton has 16986 states and 24626 transitions. Word has length 77 [2025-03-03 16:09:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:09,449 INFO L471 AbstractCegarLoop]: Abstraction has 16986 states and 24626 transitions. [2025-03-03 16:09:09,449 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-03-03 16:09:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 16986 states and 24626 transitions. [2025-03-03 16:09:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:09,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:09,451 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-03-03 16:09:09,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:09:09,451 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:09,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1869555589, now seen corresponding path program 1 times [2025-03-03 16:09:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:09,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363762446] [2025-03-03 16:09:09,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:09,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:09,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:09,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:09,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:09:09,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363762446] [2025-03-03 16:09:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363762446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:09,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950924649] [2025-03-03 16:09:09,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:09,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:09,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:09,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:09,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:09,564 INFO L87 Difference]: Start difference. First operand 16986 states and 24626 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-03-03 16:09:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:10,075 INFO L93 Difference]: Finished difference Result 30950 states and 44568 transitions. [2025-03-03 16:09:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:10,075 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-03-03 16:09:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:10,111 INFO L225 Difference]: With dead ends: 30950 [2025-03-03 16:09:10,111 INFO L226 Difference]: Without dead ends: 27988 [2025-03-03 16:09:10,119 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-03-03 16:09:10,120 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6327 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6327 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:10,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6327 Valid, 3675 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27988 states. [2025-03-03 16:09:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27988 to 19946. [2025-03-03 16:09:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.4441436020858403) internal successors, (28802), 19945 states have internal predecessors, (28802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28802 transitions. [2025-03-03 16:09:10,662 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28802 transitions. Word has length 77 [2025-03-03 16:09:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:10,662 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28802 transitions. [2025-03-03 16:09:10,662 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-03-03 16:09:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28802 transitions. [2025-03-03 16:09:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 16:09:10,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:10,665 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-03-03 16:09:10,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:09:10,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:10,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1735618441, now seen corresponding path program 1 times [2025-03-03 16:09:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466006629] [2025-03-03 16:09:10,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:10,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 16:09:10,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 16:09:10,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:10,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:10,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:10,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466006629] [2025-03-03 16:09:10,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466006629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:10,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163250131] [2025-03-03 16:09:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:10,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:10,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:10,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:10,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:10,733 INFO L87 Difference]: Start difference. First operand 19946 states and 28802 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-03-03 16:09:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:11,028 INFO L93 Difference]: Finished difference Result 38350 states and 54788 transitions. [2025-03-03 16:09:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:11,029 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-03-03 16:09:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:11,049 INFO L225 Difference]: With dead ends: 38350 [2025-03-03 16:09:11,050 INFO L226 Difference]: Without dead ends: 19948 [2025-03-03 16:09:11,058 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-03-03 16:09:11,059 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-03-03 16:09:11,059 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-03-03 16:09:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19948 states. [2025-03-03 16:09:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19948 to 19946. [2025-03-03 16:09:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.4293020457280385) internal successors, (28506), 19945 states have internal predecessors, (28506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28506 transitions. [2025-03-03 16:09:11,378 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28506 transitions. Word has length 78 [2025-03-03 16:09:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:11,378 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28506 transitions. [2025-03-03 16:09:11,378 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-03-03 16:09:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28506 transitions. [2025-03-03 16:09:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:09:11,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:11,382 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-03-03 16:09:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:09:11,382 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:11,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash -783999357, now seen corresponding path program 1 times [2025-03-03 16:09:11,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:11,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766052965] [2025-03-03 16:09:11,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:11,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:09:11,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:09:11,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:11,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766052965] [2025-03-03 16:09:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766052965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:11,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:11,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:11,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38656290] [2025-03-03 16:09:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:11,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:11,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:11,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:11,450 INFO L87 Difference]: Start difference. First operand 19946 states and 28506 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-03-03 16:09:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:11,562 INFO L93 Difference]: Finished difference Result 26833 states and 38200 transitions. [2025-03-03 16:09:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:11,562 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-03-03 16:09:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:11,572 INFO L225 Difference]: With dead ends: 26833 [2025-03-03 16:09:11,572 INFO L226 Difference]: Without dead ends: 8431 [2025-03-03 16:09:11,585 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-03-03 16:09:11,586 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-03-03 16:09:11,586 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-03-03 16:09:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2025-03-03 16:09:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8423. [2025-03-03 16:09:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8423 states, 8421 states have (on average 1.4723904524403277) internal successors, (12399), 8422 states have internal predecessors, (12399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12399 transitions. [2025-03-03 16:09:11,714 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12399 transitions. Word has length 79 [2025-03-03 16:09:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:11,714 INFO L471 AbstractCegarLoop]: Abstraction has 8423 states and 12399 transitions. [2025-03-03 16:09:11,714 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-03-03 16:09:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12399 transitions. [2025-03-03 16:09:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 16:09:11,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:11,715 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-03-03 16:09:11,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:09:11,716 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:11,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1691147440, now seen corresponding path program 1 times [2025-03-03 16:09:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:11,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868542479] [2025-03-03 16:09:11,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:11,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 16:09:11,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 16:09:11,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:11,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:11,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:11,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868542479] [2025-03-03 16:09:11,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868542479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:11,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:11,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:11,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306090035] [2025-03-03 16:09:11,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:11,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:11,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:11,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:11,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:11,780 INFO L87 Difference]: Start difference. First operand 8423 states and 12399 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-03-03 16:09:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:11,863 INFO L93 Difference]: Finished difference Result 11859 states and 17185 transitions. [2025-03-03 16:09:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:11,864 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-03-03 16:09:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:11,870 INFO L225 Difference]: With dead ends: 11859 [2025-03-03 16:09:11,871 INFO L226 Difference]: Without dead ends: 4993 [2025-03-03 16:09:11,874 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-03-03 16:09:11,874 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-03-03 16:09:11,874 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-03-03 16:09:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2025-03-03 16:09:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4991. [2025-03-03 16:09:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 4989 states have (on average 1.5159350571256764) internal successors, (7563), 4990 states have internal predecessors, (7563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 7563 transitions. [2025-03-03 16:09:11,942 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 7563 transitions. Word has length 80 [2025-03-03 16:09:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:11,942 INFO L471 AbstractCegarLoop]: Abstraction has 4991 states and 7563 transitions. [2025-03-03 16:09:11,942 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-03-03 16:09:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 7563 transitions. [2025-03-03 16:09:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 16:09:11,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:11,944 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-03-03 16:09:11,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:09:11,945 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash 234523383, now seen corresponding path program 1 times [2025-03-03 16:09:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:11,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240671636] [2025-03-03 16:09:11,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:11,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 16:09:11,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 16:09:11,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:11,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:12,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:12,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240671636] [2025-03-03 16:09:12,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240671636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:12,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:12,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541500944] [2025-03-03 16:09:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:12,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:12,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:12,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:12,010 INFO L87 Difference]: Start difference. First operand 4991 states and 7563 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-03-03 16:09:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:12,045 INFO L93 Difference]: Finished difference Result 6711 states and 9931 transitions. [2025-03-03 16:09:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:12,045 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-03-03 16:09:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:12,050 INFO L225 Difference]: With dead ends: 6711 [2025-03-03 16:09:12,050 INFO L226 Difference]: Without dead ends: 3277 [2025-03-03 16:09:12,052 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-03-03 16:09:12,054 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-03-03 16:09:12,054 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-03-03 16:09:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2025-03-03 16:09:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3275. [2025-03-03 16:09:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3273 states have (on average 1.5798961197677972) internal successors, (5171), 3274 states have internal predecessors, (5171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 5171 transitions. [2025-03-03 16:09:12,097 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 5171 transitions. Word has length 82 [2025-03-03 16:09:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:12,097 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 5171 transitions. [2025-03-03 16:09:12,097 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-03-03 16:09:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 5171 transitions. [2025-03-03 16:09:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 16:09:12,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:12,098 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-03-03 16:09:12,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:09:12,099 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:12,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:12,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1533089186, now seen corresponding path program 1 times [2025-03-03 16:09:12,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:12,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79142248] [2025-03-03 16:09:12,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:12,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:12,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 16:09:12,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 16:09:12,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:12,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:12,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79142248] [2025-03-03 16:09:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79142248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:12,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:12,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482355285] [2025-03-03 16:09:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:12,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:12,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:12,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:12,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:12,160 INFO L87 Difference]: Start difference. First operand 3275 states and 5171 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-03-03 16:09:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:12,184 INFO L93 Difference]: Finished difference Result 4137 states and 6343 transitions. [2025-03-03 16:09:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:12,185 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-03-03 16:09:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:12,189 INFO L225 Difference]: With dead ends: 4137 [2025-03-03 16:09:12,189 INFO L226 Difference]: Without dead ends: 2419 [2025-03-03 16:09:12,190 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-03-03 16:09:12,191 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-03-03 16:09:12,191 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-03-03 16:09:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2025-03-03 16:09:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2417. [2025-03-03 16:09:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2415 states have (on average 1.6513457556935818) internal successors, (3988), 2416 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3988 transitions. [2025-03-03 16:09:12,218 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3988 transitions. Word has length 84 [2025-03-03 16:09:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:12,218 INFO L471 AbstractCegarLoop]: Abstraction has 2417 states and 3988 transitions. [2025-03-03 16:09:12,218 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-03-03 16:09:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3988 transitions. [2025-03-03 16:09:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 16:09:12,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:12,219 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-03-03 16:09:12,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:09:12,219 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:12,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash 296643301, now seen corresponding path program 1 times [2025-03-03 16:09:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:12,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814471820] [2025-03-03 16:09:12,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 16:09:12,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 16:09:12,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:12,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814471820] [2025-03-03 16:09:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814471820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868346849] [2025-03-03 16:09:12,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:12,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:12,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:12,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:09:12,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:09:12,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 16:09:12,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 16:09:12,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:12,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:12,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:09:12,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:12,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:13,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868346849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:13,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:13,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-03-03 16:09:13,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5255492] [2025-03-03 16:09:13,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:13,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 16:09:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:13,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 16:09:13,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:09:13,229 INFO L87 Difference]: Start difference. First operand 2417 states and 3988 transitions. Second operand has 19 states, 19 states have (on average 12.894736842105264) internal successors, (245), 19 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-03-03 16:09:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:15,341 INFO L93 Difference]: Finished difference Result 9196 states and 12890 transitions. [2025-03-03 16:09:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-03 16:09:15,342 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.894736842105264) internal successors, (245), 19 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-03-03 16:09:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:15,350 INFO L225 Difference]: With dead ends: 9196 [2025-03-03 16:09:15,350 INFO L226 Difference]: Without dead ends: 8250 [2025-03-03 16:09:15,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=913, Invalid=3509, Unknown=0, NotChecked=0, Total=4422 [2025-03-03 16:09:15,355 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 15008 mSDsluCounter, 8063 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15008 SdHoareTripleChecker+Valid, 9618 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:15,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15008 Valid, 9618 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:09:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8250 states. [2025-03-03 16:09:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8250 to 7532. [2025-03-03 16:09:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7532 states, 7530 states have (on average 1.4088977423638778) internal successors, (10609), 7531 states have internal predecessors, (10609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 10609 transitions. [2025-03-03 16:09:15,495 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 10609 transitions. Word has length 86 [2025-03-03 16:09:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:15,495 INFO L471 AbstractCegarLoop]: Abstraction has 7532 states and 10609 transitions. [2025-03-03 16:09:15,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.894736842105264) internal successors, (245), 19 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-03-03 16:09:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 10609 transitions. [2025-03-03 16:09:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 16:09:15,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:15,496 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-03-03 16:09:15,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:09:15,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 16:09:15,697 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:15,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1757617236, now seen corresponding path program 1 times [2025-03-03 16:09:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:15,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368096551] [2025-03-03 16:09:15,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:15,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:15,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:09:15,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:09:15,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:15,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:16,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368096551] [2025-03-03 16:09:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368096551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345208267] [2025-03-03 16:09:16,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:16,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:16,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:16,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:09:16,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:09:16,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:09:16,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:09:16,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:16,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:16,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:09:16,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:17,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345208267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:17,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:17,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-03 16:09:17,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627272133] [2025-03-03 16:09:17,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:17,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 16:09:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:17,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 16:09:17,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2025-03-03 16:09:17,743 INFO L87 Difference]: Start difference. First operand 7532 states and 10609 transitions. Second operand has 28 states, 28 states have (on average 8.107142857142858) internal successors, (227), 27 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:19,399 INFO L93 Difference]: Finished difference Result 33336 states and 44427 transitions. [2025-03-03 16:09:19,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 16:09:19,400 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.107142857142858) internal successors, (227), 27 states have internal predecessors, (227), 0 states have call successors, (0), 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-03-03 16:09:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:19,429 INFO L225 Difference]: With dead ends: 33336 [2025-03-03 16:09:19,429 INFO L226 Difference]: Without dead ends: 27408 [2025-03-03 16:09:19,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=643, Invalid=2663, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 16:09:19,439 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 17509 mSDsluCounter, 6704 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17509 SdHoareTripleChecker+Valid, 8218 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:19,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17509 Valid, 8218 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:09:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2025-03-03 16:09:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 27076. [2025-03-03 16:09:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27076 states, 27074 states have (on average 1.3139174115387457) internal successors, (35573), 27075 states have internal predecessors, (35573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27076 states to 27076 states and 35573 transitions. [2025-03-03 16:09:20,054 INFO L78 Accepts]: Start accepts. Automaton has 27076 states and 35573 transitions. Word has length 87 [2025-03-03 16:09:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:20,054 INFO L471 AbstractCegarLoop]: Abstraction has 27076 states and 35573 transitions. [2025-03-03 16:09:20,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.107142857142858) internal successors, (227), 27 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 27076 states and 35573 transitions. [2025-03-03 16:09:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 16:09:20,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:20,055 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-03-03 16:09:20,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:09:20,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:09:20,256 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:20,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1562871412, now seen corresponding path program 1 times [2025-03-03 16:09:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855924352] [2025-03-03 16:09:20,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:20,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:09:20,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:09:20,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:20,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:20,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855924352] [2025-03-03 16:09:20,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855924352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024097407] [2025-03-03 16:09:20,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:20,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:20,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:20,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:09:20,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:09:20,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:09:20,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:09:20,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:20,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:20,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:09:20,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:20,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024097407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:21,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:21,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:09:21,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041753404] [2025-03-03 16:09:21,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:21,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:09:21,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:21,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:09:21,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:09:21,854 INFO L87 Difference]: Start difference. First operand 27076 states and 35573 transitions. Second operand has 25 states, 25 states have (on average 9.8) internal successors, (245), 24 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-03-03 16:09:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:24,830 INFO L93 Difference]: Finished difference Result 135104 states and 174906 transitions. [2025-03-03 16:09:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 16:09:24,830 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.8) internal successors, (245), 24 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-03-03 16:09:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:24,926 INFO L225 Difference]: With dead ends: 135104 [2025-03-03 16:09:24,926 INFO L226 Difference]: Without dead ends: 109942 [2025-03-03 16:09:24,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=526, Invalid=2230, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 16:09:24,943 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 14275 mSDsluCounter, 6887 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14275 SdHoareTripleChecker+Valid, 8405 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:24,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14275 Valid, 8405 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:09:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109942 states. [2025-03-03 16:09:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109942 to 108522. [2025-03-03 16:09:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108522 states, 108520 states have (on average 1.2609841503870254) internal successors, (136842), 108521 states have internal predecessors, (136842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108522 states to 108522 states and 136842 transitions. [2025-03-03 16:09:27,879 INFO L78 Accepts]: Start accepts. Automaton has 108522 states and 136842 transitions. Word has length 87 [2025-03-03 16:09:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:27,879 INFO L471 AbstractCegarLoop]: Abstraction has 108522 states and 136842 transitions. [2025-03-03 16:09:27,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.8) internal successors, (245), 24 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-03-03 16:09:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 108522 states and 136842 transitions. [2025-03-03 16:09:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 16:09:27,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:27,882 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-03-03 16:09:27,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:09:28,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:28,082 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:28,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:28,083 INFO L85 PathProgramCache]: Analyzing trace with hash -665924911, now seen corresponding path program 1 times [2025-03-03 16:09:28,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:28,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190022620] [2025-03-03 16:09:28,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:28,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 16:09:28,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 16:09:28,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:28,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:28,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190022620] [2025-03-03 16:09:28,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190022620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:28,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816704930] [2025-03-03 16:09:28,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:28,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:28,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:09:28,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:09:28,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 16:09:28,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 16:09:28,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:28,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:28,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 16:09:28,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:32,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816704930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:34,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 18] total 43 [2025-03-03 16:09:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517809739] [2025-03-03 16:09:34,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:34,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 16:09:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:34,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 16:09:34,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1524, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 16:09:34,450 INFO L87 Difference]: Start difference. First operand 108522 states and 136842 transitions. Second operand has 43 states, 43 states have (on average 5.465116279069767) internal successors, (235), 43 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:36,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 16:09:40,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 16:09:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:49,398 INFO L93 Difference]: Finished difference Result 252536 states and 318461 transitions. [2025-03-03 16:09:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-03 16:09:49,398 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.465116279069767) internal successors, (235), 43 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 16:09:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:49,580 INFO L225 Difference]: With dead ends: 252536 [2025-03-03 16:09:49,580 INFO L226 Difference]: Without dead ends: 150014 [2025-03-03 16:09:49,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3406 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2257, Invalid=8249, Unknown=0, NotChecked=0, Total=10506 [2025-03-03 16:09:49,628 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 19585 mSDsluCounter, 20435 mSDsCounter, 0 mSdLazyCounter, 2013 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19585 SdHoareTripleChecker+Valid, 21980 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2013 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:49,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19585 Valid, 21980 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2013 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2025-03-03 16:09:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150014 states. [2025-03-03 16:09:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150014 to 118756. [2025-03-03 16:09:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118756 states, 118754 states have (on average 1.2529093756841876) internal successors, (148788), 118755 states have internal predecessors, (148788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118756 states to 118756 states and 148788 transitions. [2025-03-03 16:09:53,870 INFO L78 Accepts]: Start accepts. Automaton has 118756 states and 148788 transitions. Word has length 89 [2025-03-03 16:09:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:53,870 INFO L471 AbstractCegarLoop]: Abstraction has 118756 states and 148788 transitions. [2025-03-03 16:09:53,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.465116279069767) internal successors, (235), 43 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 118756 states and 148788 transitions. [2025-03-03 16:09:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 16:09:53,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:53,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:53,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:09:54,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:54,073 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:54,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 61894368, now seen corresponding path program 1 times [2025-03-03 16:09:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026327608] [2025-03-03 16:09:54,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:54,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 16:09:54,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 16:09:54,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:54,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:54,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026327608] [2025-03-03 16:09:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026327608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:54,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:54,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:54,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717333783] [2025-03-03 16:09:54,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:54,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:09:54,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:54,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:09:54,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:09:54,169 INFO L87 Difference]: Start difference. First operand 118756 states and 148788 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:01,970 INFO L93 Difference]: Finished difference Result 122513 states and 155678 transitions. [2025-03-03 16:10:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:10:01,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 16:10:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:02,096 INFO L225 Difference]: With dead ends: 122513 [2025-03-03 16:10:02,096 INFO L226 Difference]: Without dead ends: 121009 [2025-03-03 16:10:02,111 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-03-03 16:10:02,111 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 2383 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 6302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:02,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 815 Invalid, 6302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 16:10:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121009 states. [2025-03-03 16:10:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121009 to 121009. [2025-03-03 16:10:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121009 states, 121007 states have (on average 1.2554397679473088) internal successors, (151917), 121008 states have internal predecessors, (151917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121009 states to 121009 states and 151917 transitions. [2025-03-03 16:10:05,520 INFO L78 Accepts]: Start accepts. Automaton has 121009 states and 151917 transitions. Word has length 89 [2025-03-03 16:10:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:05,520 INFO L471 AbstractCegarLoop]: Abstraction has 121009 states and 151917 transitions. [2025-03-03 16:10:05,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 121009 states and 151917 transitions. [2025-03-03 16:10:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:10:05,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:05,523 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, 1] [2025-03-03 16:10:05,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 16:10:05,523 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:05,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1917138110, now seen corresponding path program 1 times [2025-03-03 16:10:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:05,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259005470] [2025-03-03 16:10:05,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:05,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:05,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:10:05,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:10:05,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:05,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259005470] [2025-03-03 16:10:07,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259005470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:10:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553415204] [2025-03-03 16:10:07,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:07,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:07,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:10:07,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:10:07,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:10:08,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:10:08,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:10:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:08,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:08,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 16:10:08,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:10:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:08,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:10:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:09,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553415204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:10:09,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:10:09,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 12, 12] total 51 [2025-03-03 16:10:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966725071] [2025-03-03 16:10:09,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:10:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-03 16:10:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:09,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-03 16:10:09,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2370, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 16:10:09,990 INFO L87 Difference]: Start difference. First operand 121009 states and 151917 transitions. Second operand has 51 states, 51 states have (on average 4.96078431372549) internal successors, (253), 51 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)