./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.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_label04.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 e08e043468e5282f02e354e2c270afb93bc3c7e2c832eb66aa2f729b9359c6aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:09:07,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:09:07,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:09:07,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:09:07,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:09:07,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:09:07,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:09:07,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:09:07,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:09:07,931 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:09:07,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:09:07,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:09:07,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:09:07,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:09:07,932 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:09:07,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:09:07,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:09:07,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:09:07,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:09:07,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:09:07,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:09:07,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:09:07,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:09:07,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:09:07,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:09:07,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:09:07,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:09:07,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:09:07,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:09:07,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:09:07,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:09:07,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:09:07,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:09:07,935 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 -> e08e043468e5282f02e354e2c270afb93bc3c7e2c832eb66aa2f729b9359c6aa [2025-03-03 16:09:08,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:09:08,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:09:08,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:09:08,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:09:08,167 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:09:08,168 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_label04.c [2025-03-03 16:09:09,253 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9383d26/ba9ffe51176949028d7de76aab2313df/FLAG52d6446a9 [2025-03-03 16:09:09,679 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:09:09,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c [2025-03-03 16:09:09,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9383d26/ba9ffe51176949028d7de76aab2313df/FLAG52d6446a9 [2025-03-03 16:09:09,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9383d26/ba9ffe51176949028d7de76aab2313df [2025-03-03 16:09:09,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:09:09,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:09:09,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:09:09,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:09:09,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:09:09,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:09:09" (1/1) ... [2025-03-03 16:09:09,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2622ed4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:09, skipping insertion in model container [2025-03-03 16:09:09,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:09:09" (1/1) ... [2025-03-03 16:09:09,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:09:10,039 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_label04.c[11640,11653] [2025-03-03 16:09:10,081 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_label04.c[18701,18714] [2025-03-03 16:09:10,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:09:10,489 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:09:10,514 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_label04.c[11640,11653] [2025-03-03 16:09:10,524 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_label04.c[18701,18714] [2025-03-03 16:09:10,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:09:10,773 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:09:10,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10 WrapperNode [2025-03-03 16:09:10,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:09:10,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:09:10,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:09:10,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:09:10,779 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:09:10" (1/1) ... [2025-03-03 16:09:10,825 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:09:10" (1/1) ... [2025-03-03 16:09:11,112 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5093 [2025-03-03 16:09:11,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:09:11,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:09:11,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:09:11,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:09:11,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,270 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:09:11,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:09:11,501 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:09:11,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:09:11,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:09:11,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (1/1) ... [2025-03-03 16:09:11,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:09:11,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:11,528 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:09:11,532 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:09:11,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:09:11,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:09:11,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:09:11,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:09:11,634 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:09:11,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:09:15,112 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: havoc calculate_output_#t~ret38#1; [2025-03-03 16:09:15,112 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3606: havoc calculate_output2_#t~ret39#1; [2025-03-03 16:09:15,113 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5096: havoc calculate_output3_#t~ret40#1; [2025-03-03 16:09:15,273 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-03-03 16:09:15,274 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:09:15,297 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:09:15,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:09:15,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:09:15 BoogieIcfgContainer [2025-03-03 16:09:15,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:09:15,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:09:15,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:09:15,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:09:15,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:09:09" (1/3) ... [2025-03-03 16:09:15,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a946d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:09:15, skipping insertion in model container [2025-03-03 16:09:15,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:10" (2/3) ... [2025-03-03 16:09:15,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a946d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:09:15, skipping insertion in model container [2025-03-03 16:09:15,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:09:15" (3/3) ... [2025-03-03 16:09:15,310 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c [2025-03-03 16:09:15,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:09:15,325 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c that has 1 procedures, 898 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:09:15,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:09:15,404 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;@3a82240c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:09:15,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:09:15,411 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:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:09:15,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:15,416 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:15,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:15,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1170366575, now seen corresponding path program 1 times [2025-03-03 16:09:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:15,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77545831] [2025-03-03 16:09:15,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:15,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:15,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:09:15,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:09:15,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:15,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:15,606 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:15,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:15,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77545831] [2025-03-03 16:09:15,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77545831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:15,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:15,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:09:15,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909810636] [2025-03-03 16:09:15,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:15,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:09:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:15,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:09:15,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:09:15,629 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 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:15,677 INFO L93 Difference]: Finished difference Result 1759 states and 3338 transitions. [2025-03-03 16:09:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:09:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:15,692 INFO L225 Difference]: With dead ends: 1759 [2025-03-03 16:09:15,692 INFO L226 Difference]: Without dead ends: 833 [2025-03-03 16:09:15,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:09:15,700 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:15,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-03 16:09:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-03 16:09:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8941034897713598) internal successors, (1574), 832 states have internal predecessors, (1574), 0 states have call successors, (0), 0 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,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1574 transitions. [2025-03-03 16:09:15,763 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1574 transitions. Word has length 24 [2025-03-03 16:09:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:15,763 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1574 transitions. [2025-03-03 16:09:15,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1574 transitions. [2025-03-03 16:09:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:09:15,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:15,764 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:15,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:09:15,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:15,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2127528368, now seen corresponding path program 1 times [2025-03-03 16:09:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:15,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632439698] [2025-03-03 16:09:15,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:15,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:09:15,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:09:15,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:15,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:15,999 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:15,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:15,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632439698] [2025-03-03 16:09:15,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632439698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:15,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:15,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:09:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075374144] [2025-03-03 16:09:16,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:16,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:09:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:16,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:09:16,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:09:16,002 INFO L87 Difference]: Start difference. First operand 833 states and 1574 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:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:16,105 INFO L93 Difference]: Finished difference Result 879 states and 1645 transitions. [2025-03-03 16:09:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:09:16,106 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:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:16,130 INFO L225 Difference]: With dead ends: 879 [2025-03-03 16:09:16,130 INFO L226 Difference]: Without dead ends: 833 [2025-03-03 16:09:16,136 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:16,136 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:16,136 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.1s Time] [2025-03-03 16:09:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-03 16:09:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-03 16:09:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8567990373044525) internal successors, (1543), 832 states have internal predecessors, (1543), 0 states have call successors, (0), 0 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:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1543 transitions. [2025-03-03 16:09:16,175 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1543 transitions. Word has length 24 [2025-03-03 16:09:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:16,175 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1543 transitions. [2025-03-03 16:09:16,175 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:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1543 transitions. [2025-03-03 16:09:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:09:16,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:16,176 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:16,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:09:16,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:16,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash -130168238, now seen corresponding path program 1 times [2025-03-03 16:09:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396202704] [2025-03-03 16:09:16,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:16,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:09:16,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:09:16,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:16,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:16,430 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:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:16,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396202704] [2025-03-03 16:09:16,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396202704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:16,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:16,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:16,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448141223] [2025-03-03 16:09:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:16,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:16,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:16,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:16,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:16,433 INFO L87 Difference]: Start difference. First operand 833 states and 1543 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:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:16,642 INFO L93 Difference]: Finished difference Result 1253 states and 2213 transitions. [2025-03-03 16:09:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 16:09:16,645 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:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:16,649 INFO L225 Difference]: With dead ends: 1253 [2025-03-03 16:09:16,649 INFO L226 Difference]: Without dead ends: 1211 [2025-03-03 16:09:16,649 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:16,650 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:16,650 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:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-03-03 16:09:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 873. [2025-03-03 16:09:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8450057405281286) internal successors, (1607), 872 states have internal predecessors, (1607), 0 states have call successors, (0), 0 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:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1607 transitions. [2025-03-03 16:09:16,667 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1607 transitions. Word has length 54 [2025-03-03 16:09:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1607 transitions. [2025-03-03 16:09:16,667 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:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1607 transitions. [2025-03-03 16:09:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:09:16,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:16,668 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:16,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:09:16,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:16,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash 582728109, now seen corresponding path program 1 times [2025-03-03 16:09:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871552923] [2025-03-03 16:09:16,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:16,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:09:16,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:09:16,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:16,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:16,745 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:16,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:16,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871552923] [2025-03-03 16:09:16,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871552923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:16,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:16,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635915490] [2025-03-03 16:09:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:16,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:16,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:16,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:16,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:16,747 INFO L87 Difference]: Start difference. First operand 873 states and 1607 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:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:16,770 INFO L93 Difference]: Finished difference Result 1026 states and 1850 transitions. [2025-03-03 16:09:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:16,770 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:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:16,775 INFO L225 Difference]: With dead ends: 1026 [2025-03-03 16:09:16,775 INFO L226 Difference]: Without dead ends: 944 [2025-03-03 16:09:16,775 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:16,776 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:16,777 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:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-03 16:09:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-03-03 16:09:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.824468085106383) internal successors, (1715), 941 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1715 transitions. [2025-03-03 16:09:16,802 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1715 transitions. Word has length 56 [2025-03-03 16:09:16,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:16,803 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1715 transitions. [2025-03-03 16:09:16,803 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:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1715 transitions. [2025-03-03 16:09:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:09:16,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:16,806 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:16,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:09:16,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:16,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash 615051344, now seen corresponding path program 1 times [2025-03-03 16:09:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:16,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520440741] [2025-03-03 16:09:16,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:16,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:09:16,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:09:16,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:16,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:17,055 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:17,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:17,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520440741] [2025-03-03 16:09:17,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520440741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:17,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:17,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771812872] [2025-03-03 16:09:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:17,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:17,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:17,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:17,057 INFO L87 Difference]: Start difference. First operand 942 states and 1715 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:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:17,215 INFO L93 Difference]: Finished difference Result 1095 states and 1955 transitions. [2025-03-03 16:09:17,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:17,215 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:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:17,219 INFO L225 Difference]: With dead ends: 1095 [2025-03-03 16:09:17,219 INFO L226 Difference]: Without dead ends: 944 [2025-03-03 16:09:17,219 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:17,220 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 5964 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5964 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:17,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5964 Valid, 1792 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-03 16:09:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-03-03 16:09:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.8223404255319149) internal successors, (1713), 941 states have internal predecessors, (1713), 0 states have call successors, (0), 0 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:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1713 transitions. [2025-03-03 16:09:17,238 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1713 transitions. Word has length 56 [2025-03-03 16:09:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:17,238 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1713 transitions. [2025-03-03 16:09:17,238 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:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1713 transitions. [2025-03-03 16:09:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:09:17,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:17,241 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:17,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:09:17,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:17,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1917260214, now seen corresponding path program 1 times [2025-03-03 16:09:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515253992] [2025-03-03 16:09:17,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:17,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:09:17,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:09:17,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:17,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:17,491 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:17,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515253992] [2025-03-03 16:09:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515253992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:17,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:09:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418483861] [2025-03-03 16:09:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:17,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:09:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:17,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:09:17,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:09:17,492 INFO L87 Difference]: Start difference. First operand 942 states and 1713 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:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:17,551 INFO L93 Difference]: Finished difference Result 950 states and 1722 transitions. [2025-03-03 16:09:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:09:17,552 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:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:17,556 INFO L225 Difference]: With dead ends: 950 [2025-03-03 16:09:17,556 INFO L226 Difference]: Without dead ends: 948 [2025-03-03 16:09:17,556 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:17,557 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:17,557 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:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-03 16:09:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2025-03-03 16:09:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8160676532769555) internal successors, (1718), 947 states have internal predecessors, (1718), 0 states have call successors, (0), 0 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:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1718 transitions. [2025-03-03 16:09:17,574 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1718 transitions. Word has length 57 [2025-03-03 16:09:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:17,574 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1718 transitions. [2025-03-03 16:09:17,574 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:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1718 transitions. [2025-03-03 16:09:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:17,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:17,575 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:17,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:09:17,575 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:17,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1309029714, now seen corresponding path program 1 times [2025-03-03 16:09:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:17,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383030519] [2025-03-03 16:09:17,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:17,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:17,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:17,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:17,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:17,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:17,627 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:17,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:17,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383030519] [2025-03-03 16:09:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383030519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:17,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:17,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:17,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647379148] [2025-03-03 16:09:17,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:17,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:17,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:17,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:17,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:17,629 INFO L87 Difference]: Start difference. First operand 948 states and 1718 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:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:17,648 INFO L93 Difference]: Finished difference Result 1118 states and 1979 transitions. [2025-03-03 16:09:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:17,649 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:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:17,652 INFO L225 Difference]: With dead ends: 1118 [2025-03-03 16:09:17,652 INFO L226 Difference]: Without dead ends: 1030 [2025-03-03 16:09:17,653 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:17,653 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:17,653 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:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-03-03 16:09:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1028. [2025-03-03 16:09:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1026 states have (on average 1.7923976608187135) internal successors, (1839), 1027 states have internal predecessors, (1839), 0 states have call successors, (0), 0 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:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1839 transitions. [2025-03-03 16:09:17,670 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1839 transitions. Word has length 58 [2025-03-03 16:09:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:17,670 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1839 transitions. [2025-03-03 16:09:17,670 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:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1839 transitions. [2025-03-03 16:09:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:17,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:17,670 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:17,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:09:17,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:17,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2007007086, now seen corresponding path program 1 times [2025-03-03 16:09:17,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:17,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241049091] [2025-03-03 16:09:17,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:17,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:17,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:17,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:17,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:17,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:17,718 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:17,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:17,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241049091] [2025-03-03 16:09:17,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241049091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:17,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:17,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:17,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155412242] [2025-03-03 16:09:17,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:17,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:17,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:17,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:17,720 INFO L87 Difference]: Start difference. First operand 1028 states and 1839 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:17,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:17,743 INFO L93 Difference]: Finished difference Result 1474 states and 2519 transitions. [2025-03-03 16:09:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:17,743 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:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:17,748 INFO L225 Difference]: With dead ends: 1474 [2025-03-03 16:09:17,748 INFO L226 Difference]: Without dead ends: 1239 [2025-03-03 16:09:17,749 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:17,749 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:17,749 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:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-03-03 16:09:17,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1237. [2025-03-03 16:09:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1235 states have (on average 1.7417004048582996) internal successors, (2151), 1236 states have internal predecessors, (2151), 0 states have call successors, (0), 0 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:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2151 transitions. [2025-03-03 16:09:17,772 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2151 transitions. Word has length 58 [2025-03-03 16:09:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:17,773 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 2151 transitions. [2025-03-03 16:09:17,774 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:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2151 transitions. [2025-03-03 16:09:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:17,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:17,775 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:17,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:09:17,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:17,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1559061550, now seen corresponding path program 1 times [2025-03-03 16:09:17,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:17,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258959983] [2025-03-03 16:09:17,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:17,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:17,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:17,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:17,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:17,854 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:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:17,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258959983] [2025-03-03 16:09:17,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258959983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:17,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:17,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:17,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584189611] [2025-03-03 16:09:17,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:17,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:17,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:17,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:17,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:17,856 INFO L87 Difference]: Start difference. First operand 1237 states and 2151 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:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:17,883 INFO L93 Difference]: Finished difference Result 2077 states and 3413 transitions. [2025-03-03 16:09:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:17,884 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:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:17,889 INFO L225 Difference]: With dead ends: 2077 [2025-03-03 16:09:17,889 INFO L226 Difference]: Without dead ends: 1633 [2025-03-03 16:09:17,890 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:17,891 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:17,892 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:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-03-03 16:09:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1631. [2025-03-03 16:09:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6740331491712708) internal successors, (2727), 1630 states have internal predecessors, (2727), 0 states have call successors, (0), 0 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:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2727 transitions. [2025-03-03 16:09:17,926 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2727 transitions. Word has length 58 [2025-03-03 16:09:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:17,926 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2727 transitions. [2025-03-03 16:09:17,926 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:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2727 transitions. [2025-03-03 16:09:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:17,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:17,927 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:17,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:09:17,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:17,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237422, now seen corresponding path program 1 times [2025-03-03 16:09:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116700037] [2025-03-03 16:09:17,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:17,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:17,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:17,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:17,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:17,977 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:17,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116700037] [2025-03-03 16:09:17,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116700037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:17,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:17,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:17,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300412555] [2025-03-03 16:09:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:17,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:17,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:17,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:17,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:17,978 INFO L87 Difference]: Start difference. First operand 1631 states and 2727 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:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:18,015 INFO L93 Difference]: Finished difference Result 3211 states and 5057 transitions. [2025-03-03 16:09:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:18,015 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:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:18,022 INFO L225 Difference]: With dead ends: 3211 [2025-03-03 16:09:18,022 INFO L226 Difference]: Without dead ends: 2373 [2025-03-03 16:09:18,023 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:18,023 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:18,024 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:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-03-03 16:09:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2371. [2025-03-03 16:09:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2369 states have (on average 1.5968763191219923) internal successors, (3783), 2370 states have internal predecessors, (3783), 0 states have call successors, (0), 0 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:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3783 transitions. [2025-03-03 16:09:18,065 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3783 transitions. Word has length 58 [2025-03-03 16:09:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:18,066 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3783 transitions. [2025-03-03 16:09:18,066 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:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3783 transitions. [2025-03-03 16:09:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:18,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:18,066 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:18,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:09:18,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:18,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519150, now seen corresponding path program 1 times [2025-03-03 16:09:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:18,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213213048] [2025-03-03 16:09:18,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:18,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:18,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:18,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:18,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:18,113 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:18,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:18,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213213048] [2025-03-03 16:09:18,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213213048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:18,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:18,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654873339] [2025-03-03 16:09:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:18,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:18,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:18,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:18,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:18,114 INFO L87 Difference]: Start difference. First operand 2371 states and 3783 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:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:18,161 INFO L93 Difference]: Finished difference Result 5335 states and 8057 transitions. [2025-03-03 16:09:18,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:18,162 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:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:18,173 INFO L225 Difference]: With dead ends: 5335 [2025-03-03 16:09:18,173 INFO L226 Difference]: Without dead ends: 3757 [2025-03-03 16:09:18,176 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:18,176 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:18,176 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:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2025-03-03 16:09:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3755. [2025-03-03 16:09:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3753 states have (on average 1.5195843325339728) internal successors, (5703), 3754 states have internal predecessors, (5703), 0 states have call successors, (0), 0 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:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 5703 transitions. [2025-03-03 16:09:18,246 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 5703 transitions. Word has length 58 [2025-03-03 16:09:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:18,246 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 5703 transitions. [2025-03-03 16:09:18,247 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:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 5703 transitions. [2025-03-03 16:09:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:09:18,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:18,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:18,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:09:18,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:18,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1445214600, now seen corresponding path program 1 times [2025-03-03 16:09:18,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:18,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459458055] [2025-03-03 16:09:18,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:18,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:18,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:09:18,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:09:18,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:18,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:18,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:18,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459458055] [2025-03-03 16:09:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459458055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:09:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650594974] [2025-03-03 16:09:18,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:18,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:18,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:18,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:18,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:18,299 INFO L87 Difference]: Start difference. First operand 3755 states and 5703 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:21,111 INFO L93 Difference]: Finished difference Result 5259 states and 8576 transitions. [2025-03-03 16:09:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:21,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 16:09:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:21,122 INFO L225 Difference]: With dead ends: 5259 [2025-03-03 16:09:21,123 INFO L226 Difference]: Without dead ends: 4506 [2025-03-03 16:09:21,124 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:21,125 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 844 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:21,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 579 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 16:09:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2025-03-03 16:09:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 4506. [2025-03-03 16:09:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 4504 states have (on average 1.483570159857904) internal successors, (6682), 4505 states have internal predecessors, (6682), 0 states have call successors, (0), 0 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:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 6682 transitions. [2025-03-03 16:09:21,193 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 6682 transitions. Word has length 61 [2025-03-03 16:09:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:21,194 INFO L471 AbstractCegarLoop]: Abstraction has 4506 states and 6682 transitions. [2025-03-03 16:09:21,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 6682 transitions. [2025-03-03 16:09:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:21,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:21,199 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:21,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:09:21,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:21,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -926993275, now seen corresponding path program 1 times [2025-03-03 16:09:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421520126] [2025-03-03 16:09:21,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:21,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:21,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:21,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:21,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:21,325 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:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421520126] [2025-03-03 16:09:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421520126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:21,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:21,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941153375] [2025-03-03 16:09:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:21,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:21,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:21,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:21,329 INFO L87 Difference]: Start difference. First operand 4506 states and 6682 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:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:21,602 INFO L93 Difference]: Finished difference Result 19110 states and 27488 transitions. [2025-03-03 16:09:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:21,603 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:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:21,638 INFO L225 Difference]: With dead ends: 19110 [2025-03-03 16:09:21,638 INFO L226 Difference]: Without dead ends: 16996 [2025-03-03 16:09:21,645 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:21,646 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:21,646 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:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16996 states. [2025-03-03 16:09:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16996 to 7050. [2025-03-03 16:09:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7050 states, 7048 states have (on average 1.456583427922815) internal successors, (10266), 7049 states have internal predecessors, (10266), 0 states have call successors, (0), 0 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:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 10266 transitions. [2025-03-03 16:09:21,838 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 10266 transitions. Word has length 77 [2025-03-03 16:09:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:21,838 INFO L471 AbstractCegarLoop]: Abstraction has 7050 states and 10266 transitions. [2025-03-03 16:09:21,839 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:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 10266 transitions. [2025-03-03 16:09:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:21,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:21,841 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:21,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:09:21,841 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:21,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1905923771, now seen corresponding path program 1 times [2025-03-03 16:09:21,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:21,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339439006] [2025-03-03 16:09:21,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:21,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:21,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:21,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:21,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:21,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:21,991 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:21,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:21,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339439006] [2025-03-03 16:09:21,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339439006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:21,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:21,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:21,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987931500] [2025-03-03 16:09:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:21,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:21,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:21,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:21,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:21,993 INFO L87 Difference]: Start difference. First operand 7050 states and 10266 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:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:22,367 INFO L93 Difference]: Finished difference Result 22070 states and 31680 transitions. [2025-03-03 16:09:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:22,371 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:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:22,427 INFO L225 Difference]: With dead ends: 22070 [2025-03-03 16:09:22,428 INFO L226 Difference]: Without dead ends: 19108 [2025-03-03 16:09:22,435 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:22,436 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:22,436 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:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19108 states. [2025-03-03 16:09:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19108 to 11066. [2025-03-03 16:09:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11066 states, 11064 states have (on average 1.4383586406362978) internal successors, (15914), 11065 states have internal predecessors, (15914), 0 states have call successors, (0), 0 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:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 15914 transitions. [2025-03-03 16:09:22,672 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 15914 transitions. Word has length 77 [2025-03-03 16:09:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:22,672 INFO L471 AbstractCegarLoop]: Abstraction has 11066 states and 15914 transitions. [2025-03-03 16:09:22,673 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:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 15914 transitions. [2025-03-03 16:09:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:22,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:22,675 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:22,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:09:22,675 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:22,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1941097989, now seen corresponding path program 1 times [2025-03-03 16:09:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037465679] [2025-03-03 16:09:22,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:22,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:22,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:22,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:22,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:22,785 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:22,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037465679] [2025-03-03 16:09:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037465679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:22,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:22,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:22,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888016696] [2025-03-03 16:09:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:22,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:22,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:22,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:22,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:22,786 INFO L87 Difference]: Start difference. First operand 11066 states and 15914 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:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:23,091 INFO L93 Difference]: Finished difference Result 25030 states and 35856 transitions. [2025-03-03 16:09:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:23,091 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:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:23,125 INFO L225 Difference]: With dead ends: 25030 [2025-03-03 16:09:23,125 INFO L226 Difference]: Without dead ends: 22068 [2025-03-03 16:09:23,132 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:23,132 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6331 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:23,133 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:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22068 states. [2025-03-03 16:09:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22068 to 14026. [2025-03-03 16:09:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14026 states, 14024 states have (on average 1.4325442099258414) internal successors, (20090), 14025 states have internal predecessors, (20090), 0 states have call successors, (0), 0 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:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14026 states to 14026 states and 20090 transitions. [2025-03-03 16:09:23,602 INFO L78 Accepts]: Start accepts. Automaton has 14026 states and 20090 transitions. Word has length 77 [2025-03-03 16:09:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:23,603 INFO L471 AbstractCegarLoop]: Abstraction has 14026 states and 20090 transitions. [2025-03-03 16:09:23,603 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:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14026 states and 20090 transitions. [2025-03-03 16:09:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:23,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:23,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:23,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:09:23,606 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1938693435, now seen corresponding path program 1 times [2025-03-03 16:09:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919839049] [2025-03-03 16:09:23,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:23,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:23,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:23,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:23,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:23,708 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:23,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:23,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919839049] [2025-03-03 16:09:23,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919839049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:23,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:23,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304939696] [2025-03-03 16:09:23,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:23,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:23,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:23,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:23,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:23,709 INFO L87 Difference]: Start difference. First operand 14026 states and 20090 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:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:24,154 INFO L93 Difference]: Finished difference Result 27990 states and 40032 transitions. [2025-03-03 16:09:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:24,154 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:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:24,202 INFO L225 Difference]: With dead ends: 27990 [2025-03-03 16:09:24,203 INFO L226 Difference]: Without dead ends: 25028 [2025-03-03 16:09:24,210 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:24,211 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:24,211 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:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25028 states. [2025-03-03 16:09:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25028 to 16986. [2025-03-03 16:09:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16986 states, 16984 states have (on average 1.4287564766839378) internal successors, (24266), 16985 states have internal predecessors, (24266), 0 states have call successors, (0), 0 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,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16986 states to 16986 states and 24266 transitions. [2025-03-03 16:09:24,679 INFO L78 Accepts]: Start accepts. Automaton has 16986 states and 24266 transitions. Word has length 77 [2025-03-03 16:09:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:24,679 INFO L471 AbstractCegarLoop]: Abstraction has 16986 states and 24266 transitions. [2025-03-03 16:09:24,679 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:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 16986 states and 24266 transitions. [2025-03-03 16:09:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:24,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:24,682 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:24,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:09:24,682 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:24,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1869555589, now seen corresponding path program 1 times [2025-03-03 16:09:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:24,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592850668] [2025-03-03 16:09:24,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:24,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:24,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:24,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:24,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:24,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:24,815 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:24,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:24,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592850668] [2025-03-03 16:09:24,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592850668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:24,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:24,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:24,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591395497] [2025-03-03 16:09:24,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:24,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:24,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:24,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:24,816 INFO L87 Difference]: Start difference. First operand 16986 states and 24266 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:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:25,282 INFO L93 Difference]: Finished difference Result 30950 states and 44208 transitions. [2025-03-03 16:09:25,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:25,283 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:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:25,315 INFO L225 Difference]: With dead ends: 30950 [2025-03-03 16:09:25,316 INFO L226 Difference]: Without dead ends: 27988 [2025-03-03 16:09:25,325 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:25,326 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6325 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6325 SdHoareTripleChecker+Valid, 3686 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:25,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6325 Valid, 3686 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27988 states. [2025-03-03 16:09:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27988 to 19946. [2025-03-03 16:09:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.426093060569595) internal successors, (28442), 19945 states have internal predecessors, (28442), 0 states have call successors, (0), 0 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:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28442 transitions. [2025-03-03 16:09:25,696 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28442 transitions. Word has length 77 [2025-03-03 16:09:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:25,696 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28442 transitions. [2025-03-03 16:09:25,696 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:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28442 transitions. [2025-03-03 16:09:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 16:09:25,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:25,700 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:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:09:25,700 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:25,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1735618441, now seen corresponding path program 1 times [2025-03-03 16:09:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642693951] [2025-03-03 16:09:25,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:25,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 16:09:25,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 16:09:25,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:25,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:25,804 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:25,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642693951] [2025-03-03 16:09:25,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642693951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:25,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:25,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:25,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471270778] [2025-03-03 16:09:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:25,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:25,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:25,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:25,806 INFO L87 Difference]: Start difference. First operand 19946 states and 28442 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:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:26,029 INFO L93 Difference]: Finished difference Result 38350 states and 54428 transitions. [2025-03-03 16:09:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:26,030 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:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:26,050 INFO L225 Difference]: With dead ends: 38350 [2025-03-03 16:09:26,050 INFO L226 Difference]: Without dead ends: 19948 [2025-03-03 16:09:26,066 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:26,066 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:26,066 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:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19948 states. [2025-03-03 16:09:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19948 to 19946. [2025-03-03 16:09:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.411251504211793) internal successors, (28146), 19945 states have internal predecessors, (28146), 0 states have call successors, (0), 0 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:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28146 transitions. [2025-03-03 16:09:26,396 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28146 transitions. Word has length 78 [2025-03-03 16:09:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:26,396 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28146 transitions. [2025-03-03 16:09:26,396 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:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28146 transitions. [2025-03-03 16:09:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:09:26,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:26,398 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:26,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:09:26,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:26,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash -783999357, now seen corresponding path program 1 times [2025-03-03 16:09:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189246855] [2025-03-03 16:09:26,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:26,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:09:26,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:09:26,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:26,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:26,518 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:26,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:26,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189246855] [2025-03-03 16:09:26,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189246855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:26,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:26,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:26,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956557428] [2025-03-03 16:09:26,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:26,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:26,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:26,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:26,521 INFO L87 Difference]: Start difference. First operand 19946 states and 28146 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:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:26,645 INFO L93 Difference]: Finished difference Result 26833 states and 37840 transitions. [2025-03-03 16:09:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:26,646 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:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:26,656 INFO L225 Difference]: With dead ends: 26833 [2025-03-03 16:09:26,656 INFO L226 Difference]: Without dead ends: 8431 [2025-03-03 16:09:26,669 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:26,669 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:26,669 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:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2025-03-03 16:09:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8423. [2025-03-03 16:09:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8423 states, 8421 states have (on average 1.4296401852511578) internal successors, (12039), 8422 states have internal predecessors, (12039), 0 states have call successors, (0), 0 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:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12039 transitions. [2025-03-03 16:09:26,792 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12039 transitions. Word has length 79 [2025-03-03 16:09:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:26,793 INFO L471 AbstractCegarLoop]: Abstraction has 8423 states and 12039 transitions. [2025-03-03 16:09:26,793 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:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12039 transitions. [2025-03-03 16:09:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 16:09:26,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:26,795 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:26,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:09:26,796 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:26,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1691147440, now seen corresponding path program 1 times [2025-03-03 16:09:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721811674] [2025-03-03 16:09:26,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:26,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 16:09:26,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 16:09:26,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:26,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:26,858 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:26,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:26,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721811674] [2025-03-03 16:09:26,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721811674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:26,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:26,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:26,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073522256] [2025-03-03 16:09:26,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:26,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:26,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:26,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:26,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:26,859 INFO L87 Difference]: Start difference. First operand 8423 states and 12039 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:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:26,914 INFO L93 Difference]: Finished difference Result 11859 states and 16825 transitions. [2025-03-03 16:09:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:26,914 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:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:26,919 INFO L225 Difference]: With dead ends: 11859 [2025-03-03 16:09:26,920 INFO L226 Difference]: Without dead ends: 4993 [2025-03-03 16:09:26,926 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:26,928 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:26,928 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:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2025-03-03 16:09:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4991. [2025-03-03 16:09:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 4989 states have (on average 1.44377630787733) internal successors, (7203), 4990 states have internal predecessors, (7203), 0 states have call successors, (0), 0 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:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 7203 transitions. [2025-03-03 16:09:27,000 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 7203 transitions. Word has length 80 [2025-03-03 16:09:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:27,000 INFO L471 AbstractCegarLoop]: Abstraction has 4991 states and 7203 transitions. [2025-03-03 16:09:27,000 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:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 7203 transitions. [2025-03-03 16:09:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 16:09:27,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:27,001 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:27,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:09:27,001 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:27,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash 234523383, now seen corresponding path program 1 times [2025-03-03 16:09:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849990848] [2025-03-03 16:09:27,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:27,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 16:09:27,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 16:09:27,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:27,058 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:27,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:27,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849990848] [2025-03-03 16:09:27,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849990848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:27,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:27,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:27,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835343437] [2025-03-03 16:09:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:27,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:27,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:27,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:27,060 INFO L87 Difference]: Start difference. First operand 4991 states and 7203 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:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:27,096 INFO L93 Difference]: Finished difference Result 6711 states and 9571 transitions. [2025-03-03 16:09:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:27,096 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:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:27,101 INFO L225 Difference]: With dead ends: 6711 [2025-03-03 16:09:27,102 INFO L226 Difference]: Without dead ends: 3277 [2025-03-03 16:09:27,104 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:27,105 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:27,105 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:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2025-03-03 16:09:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3275. [2025-03-03 16:09:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3273 states have (on average 1.4699052856706385) internal successors, (4811), 3274 states have internal predecessors, (4811), 0 states have call successors, (0), 0 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,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4811 transitions. [2025-03-03 16:09:27,148 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4811 transitions. Word has length 82 [2025-03-03 16:09:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:27,148 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 4811 transitions. [2025-03-03 16:09:27,148 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:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4811 transitions. [2025-03-03 16:09:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 16:09:27,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:27,149 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:27,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:09:27,149 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1533089186, now seen corresponding path program 1 times [2025-03-03 16:09:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61587877] [2025-03-03 16:09:27,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:27,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 16:09:27,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 16:09:27,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:27,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:27,204 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:27,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61587877] [2025-03-03 16:09:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61587877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140711246] [2025-03-03 16:09:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:27,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:27,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:27,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:27,205 INFO L87 Difference]: Start difference. First operand 3275 states and 4811 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:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:27,247 INFO L93 Difference]: Finished difference Result 4137 states and 5983 transitions. [2025-03-03 16:09:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:27,248 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:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:27,251 INFO L225 Difference]: With dead ends: 4137 [2025-03-03 16:09:27,251 INFO L226 Difference]: Without dead ends: 2419 [2025-03-03 16:09:27,252 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:27,255 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:27,255 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:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2025-03-03 16:09:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2417. [2025-03-03 16:09:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2415 states have (on average 1.5022774327122153) internal successors, (3628), 2416 states have internal predecessors, (3628), 0 states have call successors, (0), 0 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,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3628 transitions. [2025-03-03 16:09:27,297 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3628 transitions. Word has length 84 [2025-03-03 16:09:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:27,297 INFO L471 AbstractCegarLoop]: Abstraction has 2417 states and 3628 transitions. [2025-03-03 16:09:27,297 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:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3628 transitions. [2025-03-03 16:09:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 16:09:27,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:27,299 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:27,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:09:27,300 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:27,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash 296643301, now seen corresponding path program 1 times [2025-03-03 16:09:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:27,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928936670] [2025-03-03 16:09:27,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:27,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 16:09:27,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 16:09:27,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:27,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:09:27,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928936670] [2025-03-03 16:09:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928936670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577979251] [2025-03-03 16:09:27,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:27,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:27,438 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:27,439 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:27,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 16:09:27,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 16:09:27,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:27,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:27,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:09:27,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:27,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:28,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577979251] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:28,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 20 [2025-03-03 16:09:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291416224] [2025-03-03 16:09:28,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:28,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 16:09:28,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:28,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 16:09:28,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:09:28,760 INFO L87 Difference]: Start difference. First operand 2417 states and 3628 transitions. Second operand has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:29,484 INFO L93 Difference]: Finished difference Result 5073 states and 7116 transitions. [2025-03-03 16:09:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 16:09:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 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:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:29,490 INFO L225 Difference]: With dead ends: 5073 [2025-03-03 16:09:29,490 INFO L226 Difference]: Without dead ends: 4213 [2025-03-03 16:09:29,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 16:09:29,493 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 14237 mSDsluCounter, 4886 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14237 SdHoareTripleChecker+Valid, 6399 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:29,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14237 Valid, 6399 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:09:29,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2025-03-03 16:09:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4033. [2025-03-03 16:09:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4033 states, 4031 states have (on average 1.4026296204415778) internal successors, (5654), 4032 states have internal predecessors, (5654), 0 states have call successors, (0), 0 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:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 5654 transitions. [2025-03-03 16:09:29,587 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 5654 transitions. Word has length 86 [2025-03-03 16:09:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:29,588 INFO L471 AbstractCegarLoop]: Abstraction has 4033 states and 5654 transitions. [2025-03-03 16:09:29,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 5654 transitions. [2025-03-03 16:09:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 16:09:29,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:29,589 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:29,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:09:29,790 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,SelfDestructingSolverStorable22 [2025-03-03 16:09:29,790 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:29,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1562871412, now seen corresponding path program 1 times [2025-03-03 16:09:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:29,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618356105] [2025-03-03 16:09:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:29,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:09:29,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:09:29,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:29,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:30,302 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:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618356105] [2025-03-03 16:09:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618356105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524333654] [2025-03-03 16:09:30,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:30,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:30,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:30,305 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:30,306 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:30,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:09:30,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:09:30,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:30,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:30,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:09:30,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:30,803 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:30,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:31,518 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:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524333654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:31,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:09:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143417322] [2025-03-03 16:09:31,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:31,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:09:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:31,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:09:31,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:09:31,520 INFO L87 Difference]: Start difference. First operand 4033 states and 5654 transitions. Second operand has 25 states, 25 states have (on average 9.64) internal successors, (241), 24 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:32,742 INFO L93 Difference]: Finished difference Result 12481 states and 16680 transitions. [2025-03-03 16:09:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 16:09:32,742 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.64) internal successors, (241), 24 states have internal predecessors, (241), 0 states have call successors, (0), 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:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:32,751 INFO L225 Difference]: With dead ends: 12481 [2025-03-03 16:09:32,751 INFO L226 Difference]: Without dead ends: 10134 [2025-03-03 16:09:32,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=494, Invalid=1956, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 16:09:32,754 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 20139 mSDsluCounter, 5087 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20139 SdHoareTripleChecker+Valid, 6597 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:32,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20139 Valid, 6597 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:09:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10134 states. [2025-03-03 16:09:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10134 to 8330. [2025-03-03 16:09:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8330 states, 8328 states have (on average 1.3340537944284343) internal successors, (11110), 8329 states have internal predecessors, (11110), 0 states have call successors, (0), 0 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:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8330 states to 8330 states and 11110 transitions. [2025-03-03 16:09:32,898 INFO L78 Accepts]: Start accepts. Automaton has 8330 states and 11110 transitions. Word has length 87 [2025-03-03 16:09:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:32,898 INFO L471 AbstractCegarLoop]: Abstraction has 8330 states and 11110 transitions. [2025-03-03 16:09:32,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.64) internal successors, (241), 24 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8330 states and 11110 transitions. [2025-03-03 16:09:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 16:09:32,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:32,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:32,905 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:33,103 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,SelfDestructingSolverStorable23 [2025-03-03 16:09:33,103 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:33,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1784058686, now seen corresponding path program 1 times [2025-03-03 16:09:33,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:33,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811328329] [2025-03-03 16:09:33,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:33,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 16:09:33,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 16:09:33,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:33,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:33,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:33,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811328329] [2025-03-03 16:09:33,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811328329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:33,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332761282] [2025-03-03 16:09:33,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:33,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:33,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:33,390 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:33,391 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:33,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 16:09:33,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 16:09:33,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:33,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:33,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:09:33,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:33,860 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:33,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:34,378 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:34,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332761282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:34,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:34,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:09:34,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399847745] [2025-03-03 16:09:34,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:34,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:09:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:34,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:09:34,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:09:34,380 INFO L87 Difference]: Start difference. First operand 8330 states and 11110 transitions. Second operand has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 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,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:36,124 INFO L93 Difference]: Finished difference Result 46126 states and 60126 transitions. [2025-03-03 16:09:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 16:09:36,125 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 16:09:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:36,165 INFO L225 Difference]: With dead ends: 46126 [2025-03-03 16:09:36,165 INFO L226 Difference]: Without dead ends: 39753 [2025-03-03 16:09:36,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=690, Invalid=2970, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 16:09:36,180 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 22290 mSDsluCounter, 8401 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22290 SdHoareTripleChecker+Valid, 9946 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:36,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22290 Valid, 9946 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:09:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39753 states. [2025-03-03 16:09:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39753 to 27879. [2025-03-03 16:09:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27879 states, 27877 states have (on average 1.2789754995157299) internal successors, (35654), 27878 states have internal predecessors, (35654), 0 states have call successors, (0), 0 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,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27879 states to 27879 states and 35654 transitions. [2025-03-03 16:09:36,811 INFO L78 Accepts]: Start accepts. Automaton has 27879 states and 35654 transitions. Word has length 88 [2025-03-03 16:09:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:36,811 INFO L471 AbstractCegarLoop]: Abstraction has 27879 states and 35654 transitions. [2025-03-03 16:09:36,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 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,811 INFO L276 IsEmpty]: Start isEmpty. Operand 27879 states and 35654 transitions. [2025-03-03 16:09:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:09:36,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:36,813 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:09:36,819 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:37,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:37,014 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:37,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1917138110, now seen corresponding path program 1 times [2025-03-03 16:09:37,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:37,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560696658] [2025-03-03 16:09:37,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:37,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:09:37,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:09:37,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:37,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:39,562 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:39,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:39,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560696658] [2025-03-03 16:09:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560696658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:39,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897000764] [2025-03-03 16:09:39,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:39,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:39,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:39,569 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:39,570 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:39,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:09:39,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:09:39,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:39,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:39,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-03 16:09:39,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:45,490 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:45,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:53,255 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:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897000764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:53,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:53,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 36, 31] total 96 [2025-03-03 16:09:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657463230] [2025-03-03 16:09:53,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:53,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-03 16:09:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:53,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-03 16:09:53,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=8075, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 16:09:53,259 INFO L87 Difference]: Start difference. First operand 27879 states and 35654 transitions. Second operand has 96 states, 96 states have (on average 2.6666666666666665) internal successors, (256), 96 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)