./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.7.ufo.UNBOUNDED.pals+Problem12_label05.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 058bf7bb7159fc58d1639895d555a49cdf382897b3dae93686af695cfade8af2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:28:01,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:28:02,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:28:02,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:28:02,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:28:02,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:28:02,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:28:02,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:28:02,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:28:02,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:28:02,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:28:02,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:28:02,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:28:02,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:28:02,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:28:02,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:28:02,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:28:02,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:28:02,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:28:02,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:28:02,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:28:02,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:28:02,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:28:02,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:28:02,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:28:02,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:28:02,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:28:02,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:28:02,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:28:02,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:28:02,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:28:02,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:28:02,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:28:02,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:28:02,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:28:02,036 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:28:02,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:28:02,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:28:02,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:28:02,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:28:02,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:28:02,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:28:02,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:28:02,037 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 -> 058bf7bb7159fc58d1639895d555a49cdf382897b3dae93686af695cfade8af2 [2025-03-08 07:28:02,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:28:02,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:28:02,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:28:02,251 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:28:02,251 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:28:02,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:28:03,410 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069f6be23/07f75684ebf544e5b2b82fd8f9797539/FLAG9ce64689a [2025-03-08 07:28:03,842 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:28:03,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:28:03,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069f6be23/07f75684ebf544e5b2b82fd8f9797539/FLAG9ce64689a [2025-03-08 07:28:03,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069f6be23/07f75684ebf544e5b2b82fd8f9797539 [2025-03-08 07:28:03,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:28:04,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:28:04,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:28:04,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:28:04,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:28:04,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:28:03" (1/1) ... [2025-03-08 07:28:04,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb1028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:04, skipping insertion in model container [2025-03-08 07:28:04,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:28:03" (1/1) ... [2025-03-08 07:28:04,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:28:04,368 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.7.ufo.UNBOUNDED.pals+Problem12_label05.c[20454,20467] [2025-03-08 07:28:04,422 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.7.ufo.UNBOUNDED.pals+Problem12_label05.c[27390,27403] [2025-03-08 07:28:04,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:28:04,860 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:28:04,895 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.7.ufo.UNBOUNDED.pals+Problem12_label05.c[20454,20467] [2025-03-08 07:28:04,903 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.7.ufo.UNBOUNDED.pals+Problem12_label05.c[27390,27403] [2025-03-08 07:28:05,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:28:05,183 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:28:05,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05 WrapperNode [2025-03-08 07:28:05,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:28:05,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:28:05,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:28:05,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:28:05,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,507 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5213 [2025-03-08 07:28:05,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:28:05,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:28:05,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:28:05,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:28:05,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,678 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-08 07:28:05,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:28:05,876 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:28:05,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:28:05,876 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:28:05,877 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (1/1) ... [2025-03-08 07:28:05,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:28:05,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:28:05,923 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-08 07:28:05,926 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-08 07:28:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:28:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:28:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:28:05,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:28:06,018 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:28:06,020 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:28:09,509 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5256: havoc calculate_output3_#t~ret47#1; [2025-03-08 07:28:09,510 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc calculate_output_#t~ret45#1; [2025-03-08 07:28:09,510 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3766: havoc calculate_output2_#t~ret46#1; [2025-03-08 07:28:09,644 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-03-08 07:28:09,645 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:28:09,676 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:28:09,677 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:28:09,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:28:09 BoogieIcfgContainer [2025-03-08 07:28:09,677 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:28:09,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:28:09,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:28:09,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:28:09,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:28:03" (1/3) ... [2025-03-08 07:28:09,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aec13b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:28:09, skipping insertion in model container [2025-03-08 07:28:09,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:05" (2/3) ... [2025-03-08 07:28:09,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aec13b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:28:09, skipping insertion in model container [2025-03-08 07:28:09,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:28:09" (3/3) ... [2025-03-08 07:28:09,686 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:28:09,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:28:09,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 931 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:28:09,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:28:09,761 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;@3ddf8e6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:28:09,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:28:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 0 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-08 07:28:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 07:28:09,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:09,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] [2025-03-08 07:28:09,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:09,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1710653810, now seen corresponding path program 1 times [2025-03-08 07:28:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357349028] [2025-03-08 07:28:09,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:09,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 07:28:09,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 07:28:09,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:09,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:09,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-08 07:28:09,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:09,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357349028] [2025-03-08 07:28:09,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357349028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:09,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:09,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:28:09,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140163949] [2025-03-08 07:28:09,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:09,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:28:09,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:10,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:28:10,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:28:10,005 INFO L87 Difference]: Start difference. First operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-08 07:28:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:10,073 INFO L93 Difference]: Finished difference Result 1805 states and 3421 transitions. [2025-03-08 07:28:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:28:10,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-08 07:28:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:10,084 INFO L225 Difference]: With dead ends: 1805 [2025-03-08 07:28:10,084 INFO L226 Difference]: Without dead ends: 866 [2025-03-08 07:28:10,094 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-08 07:28:10,096 INFO L435 NwaCegarLoop]: 1699 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, 1699 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-08 07:28:10,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-08 07:28:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2025-03-08 07:28:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.8923611111111112) internal successors, (1635), 865 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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-08 07:28:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1635 transitions. [2025-03-08 07:28:10,178 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1635 transitions. Word has length 28 [2025-03-08 07:28:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:10,178 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1635 transitions. [2025-03-08 07:28:10,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-08 07:28:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1635 transitions. [2025-03-08 07:28:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 07:28:10,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:10,179 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] [2025-03-08 07:28:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:28:10,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:10,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:10,180 INFO L85 PathProgramCache]: Analyzing trace with hash 546257197, now seen corresponding path program 1 times [2025-03-08 07:28:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:10,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224798625] [2025-03-08 07:28:10,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:10,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:10,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 07:28:10,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 07:28:10,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:10,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:10,390 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-08 07:28:10,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:10,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224798625] [2025-03-08 07:28:10,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224798625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:10,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:10,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:28:10,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582603953] [2025-03-08 07:28:10,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:10,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:28:10,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:10,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:28:10,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:28:10,395 INFO L87 Difference]: Start difference. First operand 866 states and 1635 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-08 07:28:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:10,514 INFO L93 Difference]: Finished difference Result 926 states and 1729 transitions. [2025-03-08 07:28:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:28:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-08 07:28:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:10,519 INFO L225 Difference]: With dead ends: 926 [2025-03-08 07:28:10,519 INFO L226 Difference]: Without dead ends: 866 [2025-03-08 07:28:10,521 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-08 07:28:10,522 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 0 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:10,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6477 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-08 07:28:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2025-03-08 07:28:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.8344907407407407) internal successors, (1585), 865 states have internal predecessors, (1585), 0 states have call successors, (0), 0 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-08 07:28:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1585 transitions. [2025-03-08 07:28:10,540 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1585 transitions. Word has length 28 [2025-03-08 07:28:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:10,540 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1585 transitions. [2025-03-08 07:28:10,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-08 07:28:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1585 transitions. [2025-03-08 07:28:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 07:28:10,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:10,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:10,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:28:10,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:10,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1388303542, now seen corresponding path program 1 times [2025-03-08 07:28:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:10,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020831917] [2025-03-08 07:28:10,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:10,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 07:28:10,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 07:28:10,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:10,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:10,787 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-08 07:28:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:10,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020831917] [2025-03-08 07:28:10,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020831917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:10,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:10,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931194278] [2025-03-08 07:28:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:10,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:28:10,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:10,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:28:10,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:28:10,790 INFO L87 Difference]: Start difference. First operand 866 states and 1585 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:15,626 INFO L93 Difference]: Finished difference Result 3121 states and 5894 transitions. [2025-03-08 07:28:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:28:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-08 07:28:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:15,634 INFO L225 Difference]: With dead ends: 3121 [2025-03-08 07:28:15,635 INFO L226 Difference]: Without dead ends: 2368 [2025-03-08 07:28:15,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:28:15,636 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 2473 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2473 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:15,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2473 Valid, 857 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 07:28:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2025-03-08 07:28:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2025-03-08 07:28:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2366 states have (on average 1.5684699915469147) internal successors, (3711), 2367 states have internal predecessors, (3711), 0 states have call successors, (0), 0 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-08 07:28:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3711 transitions. [2025-03-08 07:28:15,691 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3711 transitions. Word has length 60 [2025-03-08 07:28:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:15,691 INFO L471 AbstractCegarLoop]: Abstraction has 2368 states and 3711 transitions. [2025-03-08 07:28:15,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3711 transitions. [2025-03-08 07:28:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:28:15,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:15,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:15,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:28:15,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:15,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1657211218, now seen corresponding path program 1 times [2025-03-08 07:28:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:15,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690629080] [2025-03-08 07:28:15,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:15,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:28:15,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:28:15,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:15,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:15,956 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-08 07:28:15,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690629080] [2025-03-08 07:28:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690629080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:15,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:15,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787877156] [2025-03-08 07:28:15,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:15,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:15,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:15,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:15,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:15,957 INFO L87 Difference]: Start difference. First operand 2368 states and 3711 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-08 07:28:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:16,258 INFO L93 Difference]: Finished difference Result 3152 states and 4971 transitions. [2025-03-08 07:28:16,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 07:28:16,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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-08 07:28:16,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:16,268 INFO L225 Difference]: With dead ends: 3152 [2025-03-08 07:28:16,269 INFO L226 Difference]: Without dead ends: 3096 [2025-03-08 07:28:16,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:28:16,271 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 11538 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11538 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:16,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11538 Valid, 4683 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2025-03-08 07:28:16,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 2422. [2025-03-08 07:28:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2420 states have (on average 1.5694214876033057) internal successors, (3798), 2421 states have internal predecessors, (3798), 0 states have call successors, (0), 0 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-08 07:28:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 3798 transitions. [2025-03-08 07:28:16,316 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 3798 transitions. Word has length 77 [2025-03-08 07:28:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:16,316 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 3798 transitions. [2025-03-08 07:28:16,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-08 07:28:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3798 transitions. [2025-03-08 07:28:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:28:16,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:16,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:16,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:28:16,318 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:16,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:16,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1973239561, now seen corresponding path program 1 times [2025-03-08 07:28:16,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:16,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942679766] [2025-03-08 07:28:16,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:16,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:16,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:28:16,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:28:16,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:16,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:16,426 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-08 07:28:16,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:16,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942679766] [2025-03-08 07:28:16,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942679766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:16,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:16,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:16,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979783041] [2025-03-08 07:28:16,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:16,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:16,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:16,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:16,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:16,427 INFO L87 Difference]: Start difference. First operand 2422 states and 3798 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-08 07:28:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:16,458 INFO L93 Difference]: Finished difference Result 2631 states and 4133 transitions. [2025-03-08 07:28:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:16,458 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-08 07:28:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:16,467 INFO L225 Difference]: With dead ends: 2631 [2025-03-08 07:28:16,467 INFO L226 Difference]: Without dead ends: 2521 [2025-03-08 07:28:16,468 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-08 07:28:16,469 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1500 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:16,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1664 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2025-03-08 07:28:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2517. [2025-03-08 07:28:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2515 states have (on average 1.5697813121272366) internal successors, (3948), 2516 states have internal predecessors, (3948), 0 states have call successors, (0), 0 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-08 07:28:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3948 transitions. [2025-03-08 07:28:16,513 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3948 transitions. Word has length 79 [2025-03-08 07:28:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:16,514 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 3948 transitions. [2025-03-08 07:28:16,514 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-08 07:28:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3948 transitions. [2025-03-08 07:28:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:28:16,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:16,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:16,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:28:16,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:16,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2005562796, now seen corresponding path program 1 times [2025-03-08 07:28:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:16,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284230089] [2025-03-08 07:28:16,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:16,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:28:16,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:28:16,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:16,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:16,878 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-08 07:28:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284230089] [2025-03-08 07:28:16,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284230089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:16,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024909384] [2025-03-08 07:28:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:16,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:16,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:16,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:16,881 INFO L87 Difference]: Start difference. First operand 2517 states and 3948 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-08 07:28:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:17,170 INFO L93 Difference]: Finished difference Result 2724 states and 4276 transitions. [2025-03-08 07:28:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:17,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-08 07:28:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:17,216 INFO L225 Difference]: With dead ends: 2724 [2025-03-08 07:28:17,216 INFO L226 Difference]: Without dead ends: 2519 [2025-03-08 07:28:17,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:28:17,217 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 10574 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10574 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:17,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10574 Valid, 2099 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:17,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2025-03-08 07:28:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2517. [2025-03-08 07:28:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2515 states have (on average 1.568986083499006) internal successors, (3946), 2516 states have internal predecessors, (3946), 0 states have call successors, (0), 0 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-08 07:28:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3946 transitions. [2025-03-08 07:28:17,263 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3946 transitions. Word has length 79 [2025-03-08 07:28:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:17,264 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 3946 transitions. [2025-03-08 07:28:17,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-08 07:28:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3946 transitions. [2025-03-08 07:28:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:28:17,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:17,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:17,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:28:17,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:17,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2073442266, now seen corresponding path program 1 times [2025-03-08 07:28:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:17,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528185221] [2025-03-08 07:28:17,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:17,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:17,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:28:17,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:28:17,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:17,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:17,513 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-08 07:28:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528185221] [2025-03-08 07:28:17,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528185221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:17,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:17,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:28:17,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155436574] [2025-03-08 07:28:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:17,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:28:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:17,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:28:17,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:28:17,514 INFO L87 Difference]: Start difference. First operand 2517 states and 3946 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-08 07:28:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:17,568 INFO L93 Difference]: Finished difference Result 2525 states and 3955 transitions. [2025-03-08 07:28:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:28:17,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-08 07:28:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:17,576 INFO L225 Difference]: With dead ends: 2525 [2025-03-08 07:28:17,576 INFO L226 Difference]: Without dead ends: 2523 [2025-03-08 07:28:17,578 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-08 07:28:17,578 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 0 mSDsluCounter, 9461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11040 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-08 07:28:17,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11040 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2025-03-08 07:28:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2523. [2025-03-08 07:28:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2521 states have (on average 1.5672352241174137) internal successors, (3951), 2522 states have internal predecessors, (3951), 0 states have call successors, (0), 0 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-08 07:28:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3951 transitions. [2025-03-08 07:28:17,626 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3951 transitions. Word has length 80 [2025-03-08 07:28:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:17,626 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 3951 transitions. [2025-03-08 07:28:17,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-08 07:28:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3951 transitions. [2025-03-08 07:28:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:17,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:17,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:17,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:28:17,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:17,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:17,628 INFO L85 PathProgramCache]: Analyzing trace with hash -607984566, now seen corresponding path program 1 times [2025-03-08 07:28:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70958687] [2025-03-08 07:28:17,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:17,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:17,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:17,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:17,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:17,685 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-08 07:28:17,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:17,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70958687] [2025-03-08 07:28:17,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70958687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:17,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:17,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:17,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995501077] [2025-03-08 07:28:17,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:17,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:17,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:17,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:17,687 INFO L87 Difference]: Start difference. First operand 2523 states and 3951 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:17,711 INFO L93 Difference]: Finished difference Result 2929 states and 4583 transitions. [2025-03-08 07:28:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-08 07:28:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:17,719 INFO L225 Difference]: With dead ends: 2929 [2025-03-08 07:28:17,719 INFO L226 Difference]: Without dead ends: 2718 [2025-03-08 07:28:17,720 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-08 07:28:17,720 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1517 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1747 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-08 07:28:17,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2025-03-08 07:28:17,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2716. [2025-03-08 07:28:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2714 states have (on average 1.565217391304348) internal successors, (4248), 2715 states have internal predecessors, (4248), 0 states have call successors, (0), 0 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-08 07:28:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 4248 transitions. [2025-03-08 07:28:17,759 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 4248 transitions. Word has length 81 [2025-03-08 07:28:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:17,759 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 4248 transitions. [2025-03-08 07:28:17,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 4248 transitions. [2025-03-08 07:28:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:17,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:17,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:17,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:28:17,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:17,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:17,762 INFO L85 PathProgramCache]: Analyzing trace with hash -762353398, now seen corresponding path program 1 times [2025-03-08 07:28:17,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:17,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255471545] [2025-03-08 07:28:17,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:17,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:17,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:17,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:17,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:17,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:17,811 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-08 07:28:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:17,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255471545] [2025-03-08 07:28:17,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255471545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:17,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:17,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417160875] [2025-03-08 07:28:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:17,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:17,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:17,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:17,812 INFO L87 Difference]: Start difference. First operand 2716 states and 4248 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:17,840 INFO L93 Difference]: Finished difference Result 3492 states and 5446 transitions. [2025-03-08 07:28:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:17,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-08 07:28:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:17,848 INFO L225 Difference]: With dead ends: 3492 [2025-03-08 07:28:17,848 INFO L226 Difference]: Without dead ends: 3088 [2025-03-08 07:28:17,849 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-08 07:28:17,851 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1515 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1749 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-08 07:28:17,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2025-03-08 07:28:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3086. [2025-03-08 07:28:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 3084 states have (on average 1.559662775616083) internal successors, (4810), 3085 states have internal predecessors, (4810), 0 states have call successors, (0), 0 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-08 07:28:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4810 transitions. [2025-03-08 07:28:17,903 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4810 transitions. Word has length 81 [2025-03-08 07:28:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:17,903 INFO L471 AbstractCegarLoop]: Abstraction has 3086 states and 4810 transitions. [2025-03-08 07:28:17,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4810 transitions. [2025-03-08 07:28:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:17,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:17,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:17,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:28:17,904 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:17,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1741283894, now seen corresponding path program 1 times [2025-03-08 07:28:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:17,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368626193] [2025-03-08 07:28:17,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:17,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:17,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:17,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:17,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:17,953 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-08 07:28:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368626193] [2025-03-08 07:28:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368626193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:17,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:17,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027477835] [2025-03-08 07:28:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:17,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:17,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:17,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:17,954 INFO L87 Difference]: Start difference. First operand 3086 states and 4810 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:17,991 INFO L93 Difference]: Finished difference Result 4570 states and 7076 transitions. [2025-03-08 07:28:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:17,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-08 07:28:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:18,008 INFO L225 Difference]: With dead ends: 4570 [2025-03-08 07:28:18,008 INFO L226 Difference]: Without dead ends: 3796 [2025-03-08 07:28:18,013 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-08 07:28:18,014 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1513 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1751 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-08 07:28:18,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1751 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2025-03-08 07:28:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3794. [2025-03-08 07:28:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3792 states have (on average 1.5479957805907174) internal successors, (5870), 3793 states have internal predecessors, (5870), 0 states have call successors, (0), 0 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-08 07:28:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5870 transitions. [2025-03-08 07:28:18,084 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5870 transitions. Word has length 81 [2025-03-08 07:28:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:18,084 INFO L471 AbstractCegarLoop]: Abstraction has 3794 states and 5870 transitions. [2025-03-08 07:28:18,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5870 transitions. [2025-03-08 07:28:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:18,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:18,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:18,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:28:18,085 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:18,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2105737866, now seen corresponding path program 1 times [2025-03-08 07:28:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:18,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965763747] [2025-03-08 07:28:18,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:18,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:18,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:18,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:18,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:18,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:18,129 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-08 07:28:18,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:18,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965763747] [2025-03-08 07:28:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965763747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:18,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311573600] [2025-03-08 07:28:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:18,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:18,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:18,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:18,130 INFO L87 Difference]: Start difference. First operand 3794 states and 5870 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:18,173 INFO L93 Difference]: Finished difference Result 6630 states and 10144 transitions. [2025-03-08 07:28:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-08 07:28:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:18,182 INFO L225 Difference]: With dead ends: 6630 [2025-03-08 07:28:18,183 INFO L226 Difference]: Without dead ends: 5148 [2025-03-08 07:28:18,185 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-08 07:28:18,186 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1511 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1753 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-08 07:28:18,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1753 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5148 states. [2025-03-08 07:28:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148 to 5146. [2025-03-08 07:28:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5144 states have (on average 1.5283825816485226) internal successors, (7862), 5145 states have internal predecessors, (7862), 0 states have call successors, (0), 0 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-08 07:28:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 7862 transitions. [2025-03-08 07:28:18,328 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 7862 transitions. Word has length 81 [2025-03-08 07:28:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:18,328 INFO L471 AbstractCegarLoop]: Abstraction has 5146 states and 7862 transitions. [2025-03-08 07:28:18,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 7862 transitions. [2025-03-08 07:28:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:18,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:18,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:18,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:28:18,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:18,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1774053558, now seen corresponding path program 1 times [2025-03-08 07:28:18,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:18,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799597593] [2025-03-08 07:28:18,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:18,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:18,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:18,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:18,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:18,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:18,379 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-08 07:28:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:18,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799597593] [2025-03-08 07:28:18,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799597593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:18,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:18,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424548480] [2025-03-08 07:28:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:18,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:18,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:18,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:18,380 INFO L87 Difference]: Start difference. First operand 5146 states and 7862 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:18,453 INFO L93 Difference]: Finished difference Result 10558 states and 15896 transitions. [2025-03-08 07:28:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-08 07:28:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:18,471 INFO L225 Difference]: With dead ends: 10558 [2025-03-08 07:28:18,471 INFO L226 Difference]: Without dead ends: 7724 [2025-03-08 07:28:18,477 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-08 07:28:18,477 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1509 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1755 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-08 07:28:18,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1755 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:18,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2025-03-08 07:28:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7722. [2025-03-08 07:28:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7722 states, 7720 states have (on average 1.5012953367875648) internal successors, (11590), 7721 states have internal predecessors, (11590), 0 states have call successors, (0), 0 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-08 07:28:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7722 states to 7722 states and 11590 transitions. [2025-03-08 07:28:18,618 INFO L78 Accepts]: Start accepts. Automaton has 7722 states and 11590 transitions. Word has length 81 [2025-03-08 07:28:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:18,618 INFO L471 AbstractCegarLoop]: Abstraction has 7722 states and 11590 transitions. [2025-03-08 07:28:18,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7722 states and 11590 transitions. [2025-03-08 07:28:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:18,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:18,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:18,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:28:18,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:18,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2034195466, now seen corresponding path program 1 times [2025-03-08 07:28:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:18,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891698454] [2025-03-08 07:28:18,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:18,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:18,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:18,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:18,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:18,668 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-08 07:28:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891698454] [2025-03-08 07:28:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891698454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:18,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:18,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893903199] [2025-03-08 07:28:18,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:18,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:18,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:18,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:18,670 INFO L87 Difference]: Start difference. First operand 7722 states and 11590 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:18,780 INFO L93 Difference]: Finished difference Result 18030 states and 26632 transitions. [2025-03-08 07:28:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:18,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-08 07:28:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:18,806 INFO L225 Difference]: With dead ends: 18030 [2025-03-08 07:28:18,806 INFO L226 Difference]: Without dead ends: 12620 [2025-03-08 07:28:18,815 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-08 07:28:18,816 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 1507 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1757 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-08 07:28:18,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1757 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12620 states. [2025-03-08 07:28:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12620 to 12618. [2025-03-08 07:28:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12618 states, 12616 states have (on average 1.4690868738110336) internal successors, (18534), 12617 states have internal predecessors, (18534), 0 states have call successors, (0), 0 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-08 07:28:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 18534 transitions. [2025-03-08 07:28:19,209 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 18534 transitions. Word has length 81 [2025-03-08 07:28:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:19,209 INFO L471 AbstractCegarLoop]: Abstraction has 12618 states and 18534 transitions. [2025-03-08 07:28:19,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 18534 transitions. [2025-03-08 07:28:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 07:28:19,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:19,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:19,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:28:19,211 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:19,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:19,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1506966134, now seen corresponding path program 1 times [2025-03-08 07:28:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:19,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420109460] [2025-03-08 07:28:19,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:19,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:19,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 07:28:19,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 07:28:19,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:19,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:28:19,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:19,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420109460] [2025-03-08 07:28:19,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420109460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:19,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:19,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:19,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698939254] [2025-03-08 07:28:19,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:19,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:19,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:19,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:19,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:19,282 INFO L87 Difference]: Start difference. First operand 12618 states and 18534 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:19,561 INFO L93 Difference]: Finished difference Result 23377 states and 34284 transitions. [2025-03-08 07:28:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:19,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-08 07:28:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:19,603 INFO L225 Difference]: With dead ends: 23377 [2025-03-08 07:28:19,604 INFO L226 Difference]: Without dead ends: 17614 [2025-03-08 07:28:19,616 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-08 07:28:19,617 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 1516 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1748 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-08 07:28:19,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17614 states. [2025-03-08 07:28:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17614 to 17612. [2025-03-08 07:28:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17612 states, 17610 states have (on average 1.4559909142532652) internal successors, (25640), 17611 states have internal predecessors, (25640), 0 states have call successors, (0), 0 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-08 07:28:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17612 states to 17612 states and 25640 transitions. [2025-03-08 07:28:19,983 INFO L78 Accepts]: Start accepts. Automaton has 17612 states and 25640 transitions. Word has length 83 [2025-03-08 07:28:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:19,983 INFO L471 AbstractCegarLoop]: Abstraction has 17612 states and 25640 transitions. [2025-03-08 07:28:19,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 17612 states and 25640 transitions. [2025-03-08 07:28:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:19,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:19,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:19,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:28:19,988 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:19,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:19,989 INFO L85 PathProgramCache]: Analyzing trace with hash 113999974, now seen corresponding path program 1 times [2025-03-08 07:28:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078910424] [2025-03-08 07:28:19,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:19,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:20,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:20,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:20,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:20,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:28:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078910424] [2025-03-08 07:28:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078910424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:20,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:20,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625864928] [2025-03-08 07:28:20,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:20,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:20,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:20,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:20,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:20,252 INFO L87 Difference]: Start difference. First operand 17612 states and 25640 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:21,608 INFO L93 Difference]: Finished difference Result 127836 states and 184112 transitions. [2025-03-08 07:28:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:21,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 07:28:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:21,898 INFO L225 Difference]: With dead ends: 127836 [2025-03-08 07:28:21,899 INFO L226 Difference]: Without dead ends: 112538 [2025-03-08 07:28:21,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:28:21,939 INFO L435 NwaCegarLoop]: 1678 mSDtfsCounter, 9830 mSDsluCounter, 2923 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9830 SdHoareTripleChecker+Valid, 4601 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:21,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9830 Valid, 4601 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112538 states. [2025-03-08 07:28:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112538 to 32908. [2025-03-08 07:28:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32908 states, 32906 states have (on average 1.4424117182276788) internal successors, (47464), 32907 states have internal predecessors, (47464), 0 states have call successors, (0), 0 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-08 07:28:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32908 states to 32908 states and 47464 transitions. [2025-03-08 07:28:23,350 INFO L78 Accepts]: Start accepts. Automaton has 32908 states and 47464 transitions. Word has length 104 [2025-03-08 07:28:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:23,351 INFO L471 AbstractCegarLoop]: Abstraction has 32908 states and 47464 transitions. [2025-03-08 07:28:23,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32908 states and 47464 transitions. [2025-03-08 07:28:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:23,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:23,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:23,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:28:23,357 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:23,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash -40368858, now seen corresponding path program 1 times [2025-03-08 07:28:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:23,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116175049] [2025-03-08 07:28:23,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:23,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:23,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:23,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:23,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:23,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 07:28:23,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:23,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116175049] [2025-03-08 07:28:23,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116175049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:23,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:23,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:23,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381462370] [2025-03-08 07:28:23,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:23,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:23,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:23,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:23,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:23,603 INFO L87 Difference]: Start difference. First operand 32908 states and 47464 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:25,955 INFO L93 Difference]: Finished difference Result 143132 states and 205936 transitions. [2025-03-08 07:28:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:25,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 07:28:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:26,189 INFO L225 Difference]: With dead ends: 143132 [2025-03-08 07:28:26,189 INFO L226 Difference]: Without dead ends: 127834 [2025-03-08 07:28:26,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:28:26,227 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 9851 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9851 SdHoareTripleChecker+Valid, 4497 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:26,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9851 Valid, 4497 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127834 states. [2025-03-08 07:28:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127834 to 55884. [2025-03-08 07:28:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55884 states, 55882 states have (on average 1.4323037829712608) internal successors, (80040), 55883 states have internal predecessors, (80040), 0 states have call successors, (0), 0 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-08 07:28:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55884 states to 55884 states and 80040 transitions. [2025-03-08 07:28:27,834 INFO L78 Accepts]: Start accepts. Automaton has 55884 states and 80040 transitions. Word has length 104 [2025-03-08 07:28:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:27,835 INFO L471 AbstractCegarLoop]: Abstraction has 55884 states and 80040 transitions. [2025-03-08 07:28:27,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 55884 states and 80040 transitions. [2025-03-08 07:28:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:27,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:27,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:27,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:28:27,841 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:27,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1019299354, now seen corresponding path program 1 times [2025-03-08 07:28:27,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:27,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708232751] [2025-03-08 07:28:27,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:27,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:27,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:27,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:27,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:27,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:28:28,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:28,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708232751] [2025-03-08 07:28:28,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708232751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:28,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:28,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775383595] [2025-03-08 07:28:28,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:28,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:28,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:28,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:28,025 INFO L87 Difference]: Start difference. First operand 55884 states and 80040 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:30,886 INFO L93 Difference]: Finished difference Result 158428 states and 227760 transitions. [2025-03-08 07:28:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:30,886 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 07:28:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:31,112 INFO L225 Difference]: With dead ends: 158428 [2025-03-08 07:28:31,112 INFO L226 Difference]: Without dead ends: 143130 [2025-03-08 07:28:31,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:28:31,156 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 9896 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9896 SdHoareTripleChecker+Valid, 4390 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:31,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9896 Valid, 4390 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143130 states. [2025-03-08 07:28:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143130 to 71180. [2025-03-08 07:28:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71180 states, 71178 states have (on average 1.4311163561774705) internal successors, (101864), 71179 states have internal predecessors, (101864), 0 states have call successors, (0), 0 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-08 07:28:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71180 states to 71180 states and 101864 transitions. [2025-03-08 07:28:33,380 INFO L78 Accepts]: Start accepts. Automaton has 71180 states and 101864 transitions. Word has length 104 [2025-03-08 07:28:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:33,382 INFO L471 AbstractCegarLoop]: Abstraction has 71180 states and 101864 transitions. [2025-03-08 07:28:33,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 71180 states and 101864 transitions. [2025-03-08 07:28:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:33,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:33,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:33,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:28:33,389 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:33,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:33,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1467244890, now seen corresponding path program 1 times [2025-03-08 07:28:33,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:33,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161793238] [2025-03-08 07:28:33,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:33,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:33,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:33,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:33,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:33,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 07:28:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161793238] [2025-03-08 07:28:33,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161793238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:33,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:33,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855013408] [2025-03-08 07:28:33,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:33,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:33,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:33,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:33,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:33,573 INFO L87 Difference]: Start difference. First operand 71180 states and 101864 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:37,318 INFO L93 Difference]: Finished difference Result 173724 states and 249584 transitions. [2025-03-08 07:28:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 07:28:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:37,618 INFO L225 Difference]: With dead ends: 173724 [2025-03-08 07:28:37,618 INFO L226 Difference]: Without dead ends: 158426 [2025-03-08 07:28:37,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:28:37,685 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 9946 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9946 SdHoareTripleChecker+Valid, 4356 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:37,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9946 Valid, 4356 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:37,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158426 states. [2025-03-08 07:28:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158426 to 86476. [2025-03-08 07:28:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86476 states, 86474 states have (on average 1.4303490066378333) internal successors, (123688), 86475 states have internal predecessors, (123688), 0 states have call successors, (0), 0 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-08 07:28:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86476 states to 86476 states and 123688 transitions. [2025-03-08 07:28:40,251 INFO L78 Accepts]: Start accepts. Automaton has 86476 states and 123688 transitions. Word has length 104 [2025-03-08 07:28:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:40,252 INFO L471 AbstractCegarLoop]: Abstraction has 86476 states and 123688 transitions. [2025-03-08 07:28:40,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 86476 states and 123688 transitions. [2025-03-08 07:28:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:40,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:40,257 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:28:40,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:28:40,257 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:40,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1052069018, now seen corresponding path program 1 times [2025-03-08 07:28:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:40,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202877295] [2025-03-08 07:28:40,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:40,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:40,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:40,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:40,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:40,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:28:40,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:40,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202877295] [2025-03-08 07:28:40,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202877295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:40,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:40,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:40,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659476612] [2025-03-08 07:28:40,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:40,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:40,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:40,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:40,624 INFO L87 Difference]: Start difference. First operand 86476 states and 123688 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)