./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.3.ufo.UNBOUNDED.pals+Problem12_label01.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 040103cc2656181b384aa80eed05d4be5ba0ae2b5d166dbdcdbf5ae534058d14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:20:46,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:20:46,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:20:46,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:20:46,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:20:46,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:20:46,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:20:46,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:20:46,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:20:46,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:20:46,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:20:46,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:20:46,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:20:46,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:20:46,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:20:46,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:20:46,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:20:46,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:20:46,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:20:46,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:20:46,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:20:46,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:20:46,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:20:46,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:20:46,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:20:46,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:20:46,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:20:46,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:20:46,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:20:46,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:20:46,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:20:46,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:20:46,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:20:46,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:20:46,839 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 -> 040103cc2656181b384aa80eed05d4be5ba0ae2b5d166dbdcdbf5ae534058d14 [2025-03-16 20:20:47,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:20:47,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:20:47,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:20:47,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:20:47,057 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:20:47,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:20:48,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7975ea9c/87f80cb56d464294b50fc9fc0178561c/FLAG8740c2618 [2025-03-16 20:20:48,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:20:48,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:20:48,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7975ea9c/87f80cb56d464294b50fc9fc0178561c/FLAG8740c2618 [2025-03-16 20:20:48,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7975ea9c/87f80cb56d464294b50fc9fc0178561c [2025-03-16 20:20:48,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:20:48,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:20:48,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:20:48,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:20:48,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:20:48,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:20:48" (1/1) ... [2025-03-16 20:20:48,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae1e956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:48, skipping insertion in model container [2025-03-16 20:20:48,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:20:48" (1/1) ... [2025-03-16 20:20:48,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:20:49,016 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.3.ufo.UNBOUNDED.pals+Problem12_label01.c[6450,6463] [2025-03-16 20:20:49,065 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.3.ufo.UNBOUNDED.pals+Problem12_label01.c[12005,12018] [2025-03-16 20:20:49,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:20:49,448 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:20:49,472 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.3.ufo.UNBOUNDED.pals+Problem12_label01.c[6450,6463] [2025-03-16 20:20:49,478 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.3.ufo.UNBOUNDED.pals+Problem12_label01.c[12005,12018] [2025-03-16 20:20:49,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:20:49,727 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:20:49,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49 WrapperNode [2025-03-16 20:20:49,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:20:49,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:20:49,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:20:49,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:20:49,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:49,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:49,974 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4977 [2025-03-16 20:20:49,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:20:49,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:20:49,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:20:49,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:20:49,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:49,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:50,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:50,141 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-16 20:20:50,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:50,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:50,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:50,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:50,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:50,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:50,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:20:50,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:20:50,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:20:50,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:20:50,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (1/1) ... [2025-03-16 20:20:50,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:20:50,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:50,344 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-16 20:20:50,345 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-16 20:20:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:20:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:20:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:20:50,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:20:50,441 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:20:50,443 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:20:53,634 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc calculate_output3_#t~ret31#1; [2025-03-16 20:20:53,634 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: havoc calculate_output_#t~ret29#1; [2025-03-16 20:20:53,634 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3466: havoc calculate_output2_#t~ret30#1; [2025-03-16 20:20:53,732 INFO L? ?]: Removed 730 outVars from TransFormulas that were not future-live. [2025-03-16 20:20:53,733 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:20:53,761 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:20:53,765 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:20:53,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:20:53 BoogieIcfgContainer [2025-03-16 20:20:53,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:20:53,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:20:53,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:20:53,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:20:53,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:20:48" (1/3) ... [2025-03-16 20:20:53,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112cf6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:20:53, skipping insertion in model container [2025-03-16 20:20:53,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:49" (2/3) ... [2025-03-16 20:20:53,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112cf6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:20:53, skipping insertion in model container [2025-03-16 20:20:53,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:20:53" (3/3) ... [2025-03-16 20:20:53,773 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:20:53,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:20:53,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 809 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:20:53,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:20:53,863 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;@2ced8c60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:20:53,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:20:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 809 states, 806 states have (on average 1.9764267990074442) internal successors, (1593), 808 states have internal predecessors, (1593), 0 states have call successors, (0), 0 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-16 20:20:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:20:53,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:53,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:53,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:53,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:53,878 INFO L85 PathProgramCache]: Analyzing trace with hash 25766248, now seen corresponding path program 1 times [2025-03-16 20:20:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:53,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793195075] [2025-03-16 20:20:53,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:53,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:20:53,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:20:53,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:53,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:54,029 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-16 20:20:54,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793195075] [2025-03-16 20:20:54,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793195075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:54,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:54,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:20:54,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818373077] [2025-03-16 20:20:54,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:54,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:20:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:54,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:20:54,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:20:54,051 INFO L87 Difference]: Start difference. First operand has 809 states, 806 states have (on average 1.9764267990074442) internal successors, (1593), 808 states have internal predecessors, (1593), 0 states have call successors, (0), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 20:20:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:54,110 INFO L93 Difference]: Finished difference Result 1598 states and 3148 transitions. [2025-03-16 20:20:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:20:54,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:20:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:54,126 INFO L225 Difference]: With dead ends: 1598 [2025-03-16 20:20:54,126 INFO L226 Difference]: Without dead ends: 805 [2025-03-16 20:20:54,132 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-16 20:20:54,133 INFO L435 NwaCegarLoop]: 1528 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, 1528 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-16 20:20:54,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:54,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-16 20:20:54,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-03-16 20:20:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8978829389788294) internal successors, (1524), 804 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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-16 20:20:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1524 transitions. [2025-03-16 20:20:54,204 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1524 transitions. Word has length 17 [2025-03-16 20:20:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:54,205 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1524 transitions. [2025-03-16 20:20:54,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 20:20:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1524 transitions. [2025-03-16 20:20:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:20:54,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:54,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:54,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:20:54,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:54,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:54,207 INFO L85 PathProgramCache]: Analyzing trace with hash -267636759, now seen corresponding path program 1 times [2025-03-16 20:20:54,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:54,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520849671] [2025-03-16 20:20:54,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:54,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:54,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:20:54,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:20:54,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:54,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:54,367 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-16 20:20:54,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:54,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520849671] [2025-03-16 20:20:54,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520849671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:54,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:54,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:20:54,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137768437] [2025-03-16 20:20:54,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:54,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:20:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:54,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:20:54,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:20:54,369 INFO L87 Difference]: Start difference. First operand 805 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 20:20:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:54,448 INFO L93 Difference]: Finished difference Result 839 states and 1576 transitions. [2025-03-16 20:20:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:20:54,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:20:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:54,452 INFO L225 Difference]: With dead ends: 839 [2025-03-16 20:20:54,452 INFO L226 Difference]: Without dead ends: 805 [2025-03-16 20:20:54,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:20:54,453 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4549 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:54,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4549 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-16 20:20:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-03-16 20:20:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8779576587795765) internal successors, (1508), 804 states have internal predecessors, (1508), 0 states have call successors, (0), 0 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-16 20:20:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1508 transitions. [2025-03-16 20:20:54,483 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1508 transitions. Word has length 17 [2025-03-16 20:20:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:54,483 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1508 transitions. [2025-03-16 20:20:54,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 20:20:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1508 transitions. [2025-03-16 20:20:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 20:20:54,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:54,485 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] [2025-03-16 20:20:54,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:20:54,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:54,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2091397431, now seen corresponding path program 1 times [2025-03-16 20:20:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206016532] [2025-03-16 20:20:54,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:54,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 20:20:54,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 20:20:54,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:54,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:54,643 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-16 20:20:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206016532] [2025-03-16 20:20:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206016532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:54,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:54,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:54,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127424915] [2025-03-16 20:20:54,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:54,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:54,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:54,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:54,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:54,645 INFO L87 Difference]: Start difference. First operand 805 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-16 20:20:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:54,758 INFO L93 Difference]: Finished difference Result 991 states and 1802 transitions. [2025-03-16 20:20:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:20:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-16 20:20:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:54,765 INFO L225 Difference]: With dead ends: 991 [2025-03-16 20:20:54,766 INFO L226 Difference]: Without dead ends: 960 [2025-03-16 20:20:54,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:20:54,767 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 4632 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4632 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:54,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4632 Valid, 1780 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:20:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-16 20:20:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 834. [2025-03-16 20:20:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8677884615384615) internal successors, (1554), 833 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-16 20:20:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1554 transitions. [2025-03-16 20:20:54,784 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1554 transitions. Word has length 32 [2025-03-16 20:20:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:54,784 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1554 transitions. [2025-03-16 20:20:54,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-16 20:20:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1554 transitions. [2025-03-16 20:20:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:20:54,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:54,787 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] [2025-03-16 20:20:54,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:20:54,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:54,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash 248945547, now seen corresponding path program 1 times [2025-03-16 20:20:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:54,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33605299] [2025-03-16 20:20:54,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:54,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:20:54,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:20:54,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:54,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:55,073 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-16 20:20:55,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33605299] [2025-03-16 20:20:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33605299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:55,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:55,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:55,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273425921] [2025-03-16 20:20:55,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:55,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:55,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:55,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:55,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:55,075 INFO L87 Difference]: Start difference. First operand 834 states and 1554 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 20:20:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:55,132 INFO L93 Difference]: Finished difference Result 896 states and 1650 transitions. [2025-03-16 20:20:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:20:55,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:20:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:55,135 INFO L225 Difference]: With dead ends: 896 [2025-03-16 20:20:55,135 INFO L226 Difference]: Without dead ends: 836 [2025-03-16 20:20:55,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:20:55,136 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 4420 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4420 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:55,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4420 Valid, 1593 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-16 20:20:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 834. [2025-03-16 20:20:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8665865384615385) internal successors, (1553), 833 states have internal predecessors, (1553), 0 states have call successors, (0), 0 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-16 20:20:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1553 transitions. [2025-03-16 20:20:55,149 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1553 transitions. Word has length 34 [2025-03-16 20:20:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:55,149 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1553 transitions. [2025-03-16 20:20:55,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 20:20:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1553 transitions. [2025-03-16 20:20:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:20:55,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:55,150 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] [2025-03-16 20:20:55,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:20:55,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:55,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 247902862, now seen corresponding path program 1 times [2025-03-16 20:20:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16322994] [2025-03-16 20:20:55,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:55,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:20:55,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:20:55,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:55,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:55,206 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-16 20:20:55,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:55,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16322994] [2025-03-16 20:20:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16322994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:55,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:55,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232545973] [2025-03-16 20:20:55,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:55,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:55,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:55,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:55,207 INFO L87 Difference]: Start difference. First operand 834 states and 1553 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 20:20:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:55,234 INFO L93 Difference]: Finished difference Result 943 states and 1722 transitions. [2025-03-16 20:20:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:55,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:20:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:55,238 INFO L225 Difference]: With dead ends: 943 [2025-03-16 20:20:55,238 INFO L226 Difference]: Without dead ends: 883 [2025-03-16 20:20:55,238 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-16 20:20:55,239 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1546 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-16 20:20:55,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1546 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-16 20:20:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 879. [2025-03-16 20:20:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 0 states have call successors, (0), 0 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-16 20:20:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2025-03-16 20:20:55,256 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 34 [2025-03-16 20:20:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:55,256 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2025-03-16 20:20:55,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 20:20:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2025-03-16 20:20:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 20:20:55,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:55,257 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] [2025-03-16 20:20:55,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:20:55,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -871637575, now seen corresponding path program 1 times [2025-03-16 20:20:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399577916] [2025-03-16 20:20:55,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:55,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 20:20:55,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 20:20:55,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:55,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399577916] [2025-03-16 20:20:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399577916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:55,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:55,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:20:55,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083476331] [2025-03-16 20:20:55,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:55,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:20:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:55,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:20:55,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:20:55,443 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-16 20:20:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:55,485 INFO L93 Difference]: Finished difference Result 885 states and 1627 transitions. [2025-03-16 20:20:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:20:55,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-16 20:20:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:55,489 INFO L225 Difference]: With dead ends: 885 [2025-03-16 20:20:55,490 INFO L226 Difference]: Without dead ends: 883 [2025-03-16 20:20:55,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:20:55,492 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 0 mSDsluCounter, 6005 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7509 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:55,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7509 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-16 20:20:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-03-16 20:20:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8422247446083995) internal successors, (1623), 882 states have internal predecessors, (1623), 0 states have call successors, (0), 0 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-16 20:20:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1623 transitions. [2025-03-16 20:20:55,508 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1623 transitions. Word has length 35 [2025-03-16 20:20:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:55,508 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1623 transitions. [2025-03-16 20:20:55,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-16 20:20:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1623 transitions. [2025-03-16 20:20:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:20:55,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:55,509 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] [2025-03-16 20:20:55,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:20:55,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:55,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash 318841389, now seen corresponding path program 1 times [2025-03-16 20:20:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:55,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230588341] [2025-03-16 20:20:55,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:55,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:20:55,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:20:55,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:55,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:55,544 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-16 20:20:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:55,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230588341] [2025-03-16 20:20:55,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230588341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:55,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:55,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:55,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369743861] [2025-03-16 20:20:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:55,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:55,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:55,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:55,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:55,545 INFO L87 Difference]: Start difference. First operand 883 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-16 20:20:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:55,565 INFO L93 Difference]: Finished difference Result 1085 states and 1923 transitions. [2025-03-16 20:20:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:55,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:20:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:55,568 INFO L225 Difference]: With dead ends: 1085 [2025-03-16 20:20:55,568 INFO L226 Difference]: Without dead ends: 976 [2025-03-16 20:20:55,569 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-16 20:20:55,569 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 1475 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1588 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-16 20:20:55,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-16 20:20:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2025-03-16 20:20:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 972 states have (on average 1.8045267489711934) internal successors, (1754), 973 states have internal predecessors, (1754), 0 states have call successors, (0), 0 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-16 20:20:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1754 transitions. [2025-03-16 20:20:55,586 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1754 transitions. Word has length 36 [2025-03-16 20:20:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:55,587 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1754 transitions. [2025-03-16 20:20:55,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-16 20:20:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1754 transitions. [2025-03-16 20:20:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:20:55,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:55,587 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] [2025-03-16 20:20:55,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:20:55,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:55,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -230947539, now seen corresponding path program 1 times [2025-03-16 20:20:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:55,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224511668] [2025-03-16 20:20:55,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:55,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:20:55,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:20:55,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:55,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:55,617 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-16 20:20:55,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:55,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224511668] [2025-03-16 20:20:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224511668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:55,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:55,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094117456] [2025-03-16 20:20:55,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:55,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:55,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:55,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:55,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:55,619 INFO L87 Difference]: Start difference. First operand 974 states and 1754 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-16 20:20:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:55,639 INFO L93 Difference]: Finished difference Result 1342 states and 2288 transitions. [2025-03-16 20:20:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:55,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:20:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:55,643 INFO L225 Difference]: With dead ends: 1342 [2025-03-16 20:20:55,643 INFO L226 Difference]: Without dead ends: 1142 [2025-03-16 20:20:55,644 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-16 20:20:55,644 INFO L435 NwaCegarLoop]: 1532 mSDtfsCounter, 1473 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1590 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-16 20:20:55,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1590 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-16 20:20:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1140. [2025-03-16 20:20:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1138 states have (on average 1.7434094903339192) internal successors, (1984), 1139 states have internal predecessors, (1984), 0 states have call successors, (0), 0 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-16 20:20:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1984 transitions. [2025-03-16 20:20:55,663 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1984 transitions. Word has length 36 [2025-03-16 20:20:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:55,663 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1984 transitions. [2025-03-16 20:20:55,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-16 20:20:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1984 transitions. [2025-03-16 20:20:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 20:20:55,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:55,664 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] [2025-03-16 20:20:55,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:20:55,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:55,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2049598067, now seen corresponding path program 1 times [2025-03-16 20:20:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220756740] [2025-03-16 20:20:55,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:55,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 20:20:55,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 20:20:55,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:55,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:55,744 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-16 20:20:55,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:55,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220756740] [2025-03-16 20:20:55,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220756740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:55,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121508685] [2025-03-16 20:20:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:55,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:55,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:55,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:55,747 INFO L87 Difference]: Start difference. First operand 1140 states and 1984 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-16 20:20:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:55,769 INFO L93 Difference]: Finished difference Result 1531 states and 2558 transitions. [2025-03-16 20:20:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:55,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-16 20:20:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:55,773 INFO L225 Difference]: With dead ends: 1531 [2025-03-16 20:20:55,773 INFO L226 Difference]: Without dead ends: 1312 [2025-03-16 20:20:55,774 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-16 20:20:55,777 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 1474 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1589 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-16 20:20:55,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1589 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-03-16 20:20:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1310. [2025-03-16 20:20:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1308 states have (on average 1.698776758409786) internal successors, (2222), 1309 states have internal predecessors, (2222), 0 states have call successors, (0), 0 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-16 20:20:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2222 transitions. [2025-03-16 20:20:55,801 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2222 transitions. Word has length 38 [2025-03-16 20:20:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:55,801 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 2222 transitions. [2025-03-16 20:20:55,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-16 20:20:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2222 transitions. [2025-03-16 20:20:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:20:55,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:55,802 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] [2025-03-16 20:20:55,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:20:55,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:55,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash -686857467, now seen corresponding path program 1 times [2025-03-16 20:20:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:55,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996519642] [2025-03-16 20:20:55,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:55,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:55,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:20:55,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:20:55,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:55,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:55,914 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-16 20:20:55,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:55,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996519642] [2025-03-16 20:20:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996519642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:55,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130496000] [2025-03-16 20:20:55,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:55,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:20:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:55,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:20:55,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:20:55,915 INFO L87 Difference]: Start difference. First operand 1310 states and 2222 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-16 20:21:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:00,761 INFO L93 Difference]: Finished difference Result 3565 states and 6531 transitions. [2025-03-16 20:21:00,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:21:00,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 20:21:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:00,771 INFO L225 Difference]: With dead ends: 3565 [2025-03-16 20:21:00,771 INFO L226 Difference]: Without dead ends: 2812 [2025-03-16 20:21:00,774 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-16 20:21:00,775 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 2356 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2356 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:00,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2356 Valid, 762 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-16 20:21:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2025-03-16 20:21:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2025-03-16 20:21:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2810 states have (on average 1.5430604982206406) internal successors, (4336), 2811 states have internal predecessors, (4336), 0 states have call successors, (0), 0 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-16 20:21:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4336 transitions. [2025-03-16 20:21:00,818 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4336 transitions. Word has length 47 [2025-03-16 20:21:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:00,819 INFO L471 AbstractCegarLoop]: Abstraction has 2812 states and 4336 transitions. [2025-03-16 20:21:00,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-16 20:21:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4336 transitions. [2025-03-16 20:21:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:21:00,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:00,820 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:00,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:21:00,821 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:00,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:00,821 INFO L85 PathProgramCache]: Analyzing trace with hash 981101146, now seen corresponding path program 1 times [2025-03-16 20:21:00,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:00,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197783946] [2025-03-16 20:21:00,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:00,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:21:00,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:21:00,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:00,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:21:00,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:00,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197783946] [2025-03-16 20:21:00,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197783946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:00,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:00,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327626145] [2025-03-16 20:21:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:00,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:00,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:00,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:00,905 INFO L87 Difference]: Start difference. First operand 2812 states and 4336 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-16 20:21:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:00,976 INFO L93 Difference]: Finished difference Result 4536 states and 6784 transitions. [2025-03-16 20:21:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:00,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 50 [2025-03-16 20:21:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:00,991 INFO L225 Difference]: With dead ends: 4536 [2025-03-16 20:21:00,992 INFO L226 Difference]: Without dead ends: 4002 [2025-03-16 20:21:00,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:21:00,995 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3048 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:00,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 3150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2025-03-16 20:21:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3344. [2025-03-16 20:21:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3344 states, 3342 states have (on average 1.521244763614602) internal successors, (5084), 3343 states have internal predecessors, (5084), 0 states have call successors, (0), 0 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-16 20:21:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 3344 states and 5084 transitions. [2025-03-16 20:21:01,084 INFO L78 Accepts]: Start accepts. Automaton has 3344 states and 5084 transitions. Word has length 50 [2025-03-16 20:21:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:01,084 INFO L471 AbstractCegarLoop]: Abstraction has 3344 states and 5084 transitions. [2025-03-16 20:21:01,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-16 20:21:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 5084 transitions. [2025-03-16 20:21:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:21:01,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:01,085 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:01,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:21:01,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:01,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash 431312218, now seen corresponding path program 1 times [2025-03-16 20:21:01,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:01,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091223921] [2025-03-16 20:21:01,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:01,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:01,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:21:01,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:21:01,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:01,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:21:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:01,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091223921] [2025-03-16 20:21:01,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091223921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:01,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:01,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:01,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066887809] [2025-03-16 20:21:01,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:01,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:01,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:01,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:01,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:01,171 INFO L87 Difference]: Start difference. First operand 3344 states and 5084 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-16 20:21:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:01,241 INFO L93 Difference]: Finished difference Result 5068 states and 7532 transitions. [2025-03-16 20:21:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:01,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 50 [2025-03-16 20:21:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:01,253 INFO L225 Difference]: With dead ends: 5068 [2025-03-16 20:21:01,253 INFO L226 Difference]: Without dead ends: 4534 [2025-03-16 20:21:01,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:21:01,255 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3053 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3053 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:01,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3053 Valid, 3139 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2025-03-16 20:21:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 4144. [2025-03-16 20:21:01,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4142 states have (on average 1.4958957025591502) internal successors, (6196), 4143 states have internal predecessors, (6196), 0 states have call successors, (0), 0 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-16 20:21:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 6196 transitions. [2025-03-16 20:21:01,328 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 6196 transitions. Word has length 50 [2025-03-16 20:21:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:01,328 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 6196 transitions. [2025-03-16 20:21:01,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-16 20:21:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 6196 transitions. [2025-03-16 20:21:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:21:01,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:01,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:01,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:21:01,329 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:01,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2017421604, now seen corresponding path program 1 times [2025-03-16 20:21:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:01,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012128675] [2025-03-16 20:21:01,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:01,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:21:01,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:21:01,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:01,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:01,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012128675] [2025-03-16 20:21:01,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012128675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:01,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:01,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662175715] [2025-03-16 20:21:01,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:01,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:01,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:01,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:01,382 INFO L87 Difference]: Start difference. First operand 4144 states and 6196 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-16 20:21:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:01,410 INFO L93 Difference]: Finished difference Result 5507 states and 8146 transitions. [2025-03-16 20:21:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 20:21:01,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:01,419 INFO L225 Difference]: With dead ends: 5507 [2025-03-16 20:21:01,419 INFO L226 Difference]: Without dead ends: 3641 [2025-03-16 20:21:01,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:01,422 INFO L435 NwaCegarLoop]: 1532 mSDtfsCounter, 34 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:01,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2025-03-16 20:21:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3639. [2025-03-16 20:21:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3637 states have (on average 1.5108605993951059) internal successors, (5495), 3638 states have internal predecessors, (5495), 0 states have call successors, (0), 0 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-16 20:21:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5495 transitions. [2025-03-16 20:21:01,477 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5495 transitions. Word has length 52 [2025-03-16 20:21:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:01,477 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 5495 transitions. [2025-03-16 20:21:01,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-16 20:21:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5495 transitions. [2025-03-16 20:21:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:21:01,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:01,478 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:21:01,478 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:01,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1273131398, now seen corresponding path program 1 times [2025-03-16 20:21:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406994861] [2025-03-16 20:21:01,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:01,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:01,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:21:01,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:21:01,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:01,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:21:01,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:01,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406994861] [2025-03-16 20:21:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406994861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:01,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:01,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752688444] [2025-03-16 20:21:01,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:01,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:01,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:01,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:01,574 INFO L87 Difference]: Start difference. First operand 3639 states and 5495 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-16 20:21:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:01,644 INFO L93 Difference]: Finished difference Result 4799 states and 7155 transitions. [2025-03-16 20:21:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 52 [2025-03-16 20:21:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:01,658 INFO L225 Difference]: With dead ends: 4799 [2025-03-16 20:21:01,658 INFO L226 Difference]: Without dead ends: 4413 [2025-03-16 20:21:01,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:21:01,663 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3045 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 3164 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:01,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 3164 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2025-03-16 20:21:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4023. [2025-03-16 20:21:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4023 states, 4021 states have (on average 1.501865207659786) internal successors, (6039), 4022 states have internal predecessors, (6039), 0 states have call successors, (0), 0 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-16 20:21:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 4023 states and 6039 transitions. [2025-03-16 20:21:01,741 INFO L78 Accepts]: Start accepts. Automaton has 4023 states and 6039 transitions. Word has length 52 [2025-03-16 20:21:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:01,741 INFO L471 AbstractCegarLoop]: Abstraction has 4023 states and 6039 transitions. [2025-03-16 20:21:01,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-16 20:21:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4023 states and 6039 transitions. [2025-03-16 20:21:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:21:01,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:01,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:01,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:21:01,745 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:01,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:01,746 INFO L85 PathProgramCache]: Analyzing trace with hash 974834018, now seen corresponding path program 1 times [2025-03-16 20:21:01,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:01,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112890885] [2025-03-16 20:21:01,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:01,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:01,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:21:01,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:21:01,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:01,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:01,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:01,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112890885] [2025-03-16 20:21:01,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112890885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:01,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:01,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:01,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144507766] [2025-03-16 20:21:01,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:01,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:01,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:01,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:01,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:01,803 INFO L87 Difference]: Start difference. First operand 4023 states and 6039 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-16 20:21:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:01,831 INFO L93 Difference]: Finished difference Result 4891 states and 7265 transitions. [2025-03-16 20:21:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:01,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 20:21:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:01,837 INFO L225 Difference]: With dead ends: 4891 [2025-03-16 20:21:01,837 INFO L226 Difference]: Without dead ends: 3161 [2025-03-16 20:21:01,840 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-16 20:21:01,840 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 29 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:01,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3010 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2025-03-16 20:21:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 3159. [2025-03-16 20:21:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3159 states, 3157 states have (on average 1.5194805194805194) internal successors, (4797), 3158 states have internal predecessors, (4797), 0 states have call successors, (0), 0 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-16 20:21:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 4797 transitions. [2025-03-16 20:21:01,879 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 4797 transitions. Word has length 53 [2025-03-16 20:21:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:01,879 INFO L471 AbstractCegarLoop]: Abstraction has 3159 states and 4797 transitions. [2025-03-16 20:21:01,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-16 20:21:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 4797 transitions. [2025-03-16 20:21:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:21:01,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:01,880 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:01,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:21:01,881 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:01,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash -918465573, now seen corresponding path program 1 times [2025-03-16 20:21:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:01,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373275216] [2025-03-16 20:21:01,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:01,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:21:01,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:21:01,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:01,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373275216] [2025-03-16 20:21:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373275216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:01,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:01,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802342544] [2025-03-16 20:21:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:01,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:01,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:01,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:01,939 INFO L87 Difference]: Start difference. First operand 3159 states and 4797 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-16 20:21:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:01,959 INFO L93 Difference]: Finished difference Result 3595 states and 5402 transitions. [2025-03-16 20:21:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:01,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 20:21:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:01,963 INFO L225 Difference]: With dead ends: 3595 [2025-03-16 20:21:01,963 INFO L226 Difference]: Without dead ends: 2729 [2025-03-16 20:21:01,964 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-16 20:21:01,965 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 26 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2995 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:01,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2995 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2025-03-16 20:21:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2727. [2025-03-16 20:21:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2725 states have (on average 1.5357798165137615) internal successors, (4185), 2726 states have internal predecessors, (4185), 0 states have call successors, (0), 0 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-16 20:21:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 4185 transitions. [2025-03-16 20:21:02,011 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 4185 transitions. Word has length 55 [2025-03-16 20:21:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:02,011 INFO L471 AbstractCegarLoop]: Abstraction has 2727 states and 4185 transitions. [2025-03-16 20:21:02,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-16 20:21:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 4185 transitions. [2025-03-16 20:21:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:21:02,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:02,013 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:02,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:21:02,013 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:02,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1545027244, now seen corresponding path program 1 times [2025-03-16 20:21:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:02,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062998989] [2025-03-16 20:21:02,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:02,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:02,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:21:02,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:21:02,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:02,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:02,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:02,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062998989] [2025-03-16 20:21:02,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062998989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990884103] [2025-03-16 20:21:02,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:02,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:02,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:02,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:02,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:21:02,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:21:02,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:21:02,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:02,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:02,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 20:21:02,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:21:03,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:21:03,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990884103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:03,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:03,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2025-03-16 20:21:03,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738928030] [2025-03-16 20:21:03,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:03,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 20:21:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:03,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 20:21:03,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:21:03,218 INFO L87 Difference]: Start difference. First operand 2727 states and 4185 transitions. Second operand has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-16 20:21:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:04,634 INFO L93 Difference]: Finished difference Result 4992 states and 7223 transitions. [2025-03-16 20:21:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-16 20:21:04,635 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 20:21:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:04,641 INFO L225 Difference]: With dead ends: 4992 [2025-03-16 20:21:04,641 INFO L226 Difference]: Without dead ends: 4558 [2025-03-16 20:21:04,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=538, Invalid=2324, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 20:21:04,644 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 18879 mSDsluCounter, 6149 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18879 SdHoareTripleChecker+Valid, 7644 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:04,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18879 Valid, 7644 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:21:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2025-03-16 20:21:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 4524. [2025-03-16 20:21:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4522 states have (on average 1.4219371959310039) internal successors, (6430), 4523 states have internal predecessors, (6430), 0 states have call successors, (0), 0 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-16 20:21:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 6430 transitions. [2025-03-16 20:21:04,709 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 6430 transitions. Word has length 57 [2025-03-16 20:21:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:04,709 INFO L471 AbstractCegarLoop]: Abstraction has 4524 states and 6430 transitions. [2025-03-16 20:21:04,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-16 20:21:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 6430 transitions. [2025-03-16 20:21:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:04,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:04,712 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:04,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 20:21:04,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 20:21:04,917 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:04,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1981655035, now seen corresponding path program 1 times [2025-03-16 20:21:04,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:04,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453135563] [2025-03-16 20:21:04,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:04,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:04,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:04,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:04,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:04,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:05,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:05,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453135563] [2025-03-16 20:21:05,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453135563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:05,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599112411] [2025-03-16 20:21:05,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:05,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:05,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:05,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:05,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:21:05,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:05,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:05,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:05,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:05,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:21:05,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:05,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:05,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599112411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:05,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:05,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:21:05,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358794786] [2025-03-16 20:21:05,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:05,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:21:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:05,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:21:05,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:21:05,931 INFO L87 Difference]: Start difference. First operand 4524 states and 6430 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-16 20:21:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:06,243 INFO L93 Difference]: Finished difference Result 6544 states and 9010 transitions. [2025-03-16 20:21:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:21:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:21:06,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:06,249 INFO L225 Difference]: With dead ends: 6544 [2025-03-16 20:21:06,249 INFO L226 Difference]: Without dead ends: 4630 [2025-03-16 20:21:06,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:21:06,251 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 11995 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11995 SdHoareTripleChecker+Valid, 4567 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:06,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11995 Valid, 4567 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:21:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2025-03-16 20:21:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 4322. [2025-03-16 20:21:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4322 states, 4320 states have (on average 1.4226851851851852) internal successors, (6146), 4321 states have internal predecessors, (6146), 0 states have call successors, (0), 0 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-16 20:21:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4322 states to 4322 states and 6146 transitions. [2025-03-16 20:21:06,317 INFO L78 Accepts]: Start accepts. Automaton has 4322 states and 6146 transitions. Word has length 58 [2025-03-16 20:21:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:06,317 INFO L471 AbstractCegarLoop]: Abstraction has 4322 states and 6146 transitions. [2025-03-16 20:21:06,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-16 20:21:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4322 states and 6146 transitions. [2025-03-16 20:21:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:06,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:06,318 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:06,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:21:06,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 20:21:06,519 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:06,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1640377797, now seen corresponding path program 1 times [2025-03-16 20:21:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126861524] [2025-03-16 20:21:06,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:06,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:06,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:06,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:06,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:06,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:06,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126861524] [2025-03-16 20:21:06,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126861524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:06,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021317639] [2025-03-16 20:21:06,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:06,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:06,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:06,724 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:06,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:21:06,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:06,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:06,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:06,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:06,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 20:21:06,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:07,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021317639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:07,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2025-03-16 20:21:07,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899609557] [2025-03-16 20:21:07,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:07,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:21:07,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:07,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:21:07,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:21:07,820 INFO L87 Difference]: Start difference. First operand 4322 states and 6146 transitions. Second operand has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 28 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-16 20:21:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:08,320 INFO L93 Difference]: Finished difference Result 8021 states and 10853 transitions. [2025-03-16 20:21:08,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 20:21:08,321 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 28 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:21:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:08,330 INFO L225 Difference]: With dead ends: 8021 [2025-03-16 20:21:08,330 INFO L226 Difference]: Without dead ends: 6352 [2025-03-16 20:21:08,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=362, Invalid=1198, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 20:21:08,333 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 13571 mSDsluCounter, 6275 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13571 SdHoareTripleChecker+Valid, 7767 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:08,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13571 Valid, 7767 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:21:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2025-03-16 20:21:08,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 6286. [2025-03-16 20:21:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6286 states, 6284 states have (on average 1.361234882240611) internal successors, (8554), 6285 states have internal predecessors, (8554), 0 states have call successors, (0), 0 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-16 20:21:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 8554 transitions. [2025-03-16 20:21:08,493 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 8554 transitions. Word has length 58 [2025-03-16 20:21:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:08,493 INFO L471 AbstractCegarLoop]: Abstraction has 6286 states and 8554 transitions. [2025-03-16 20:21:08,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 28 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-16 20:21:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 8554 transitions. [2025-03-16 20:21:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:08,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:08,494 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:08,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:21:08,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:08,696 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:08,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1084050555, now seen corresponding path program 1 times [2025-03-16 20:21:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:08,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216826248] [2025-03-16 20:21:08,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:08,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:08,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:08,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:08,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:08,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:08,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216826248] [2025-03-16 20:21:08,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216826248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:08,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516256887] [2025-03-16 20:21:08,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:08,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:08,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:08,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:08,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:21:08,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:08,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:08,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:08,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:08,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:21:08,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:09,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:09,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516256887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:09,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:09,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-16 20:21:09,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609994676] [2025-03-16 20:21:09,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:09,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 20:21:09,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:09,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 20:21:09,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:21:09,881 INFO L87 Difference]: Start difference. First operand 6286 states and 8554 transitions. Second operand has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-16 20:21:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:10,294 INFO L93 Difference]: Finished difference Result 13129 states and 17070 transitions. [2025-03-16 20:21:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:21:10,294 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:21:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:10,304 INFO L225 Difference]: With dead ends: 13129 [2025-03-16 20:21:10,304 INFO L226 Difference]: Without dead ends: 9719 [2025-03-16 20:21:10,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:21:10,309 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 11962 mSDsluCounter, 6065 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11962 SdHoareTripleChecker+Valid, 7559 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:10,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11962 Valid, 7559 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:21:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9719 states. [2025-03-16 20:21:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9719 to 9715. [2025-03-16 20:21:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9715 states, 9713 states have (on average 1.3125707814269536) internal successors, (12749), 9714 states have internal predecessors, (12749), 0 states have call successors, (0), 0 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-16 20:21:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9715 states to 9715 states and 12749 transitions. [2025-03-16 20:21:10,508 INFO L78 Accepts]: Start accepts. Automaton has 9715 states and 12749 transitions. Word has length 58 [2025-03-16 20:21:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:10,508 INFO L471 AbstractCegarLoop]: Abstraction has 9715 states and 12749 transitions. [2025-03-16 20:21:10,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-16 20:21:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 9715 states and 12749 transitions. [2025-03-16 20:21:10,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:21:10,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:10,509 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:10,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:21:10,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:10,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:10,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:10,711 INFO L85 PathProgramCache]: Analyzing trace with hash 542733369, now seen corresponding path program 1 times [2025-03-16 20:21:10,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:10,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382560398] [2025-03-16 20:21:10,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:10,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:10,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:21:10,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:21:10,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:10,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382560398] [2025-03-16 20:21:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382560398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849411512] [2025-03-16 20:21:11,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:11,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:11,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:11,392 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:11,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:21:11,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:21:11,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:21:11,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:11,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 20:21:11,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:11,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:12,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849411512] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:12,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2025-03-16 20:21:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750572034] [2025-03-16 20:21:12,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:12,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 20:21:12,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:12,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 20:21:12,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:21:12,450 INFO L87 Difference]: Start difference. First operand 9715 states and 12749 transitions. Second operand has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-16 20:21:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:15,521 INFO L93 Difference]: Finished difference Result 14841 states and 19168 transitions. [2025-03-16 20:21:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-16 20:21:15,522 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 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 59 [2025-03-16 20:21:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:15,530 INFO L225 Difference]: With dead ends: 14841 [2025-03-16 20:21:15,530 INFO L226 Difference]: Without dead ends: 10073 [2025-03-16 20:21:15,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1533, Invalid=6123, Unknown=0, NotChecked=0, Total=7656 [2025-03-16 20:21:15,535 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 7176 mSDsluCounter, 22822 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7176 SdHoareTripleChecker+Valid, 24337 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:15,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7176 Valid, 24337 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:21:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10073 states. [2025-03-16 20:21:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10073 to 7113. [2025-03-16 20:21:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7111 states have (on average 1.3390521726901983) internal successors, (9522), 7112 states have internal predecessors, (9522), 0 states have call successors, (0), 0 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-16 20:21:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 9522 transitions. [2025-03-16 20:21:15,715 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 9522 transitions. Word has length 59 [2025-03-16 20:21:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:15,715 INFO L471 AbstractCegarLoop]: Abstraction has 7113 states and 9522 transitions. [2025-03-16 20:21:15,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-16 20:21:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 9522 transitions. [2025-03-16 20:21:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 20:21:15,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:15,716 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:15,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 20:21:15,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:15,916 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:15,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash 450905028, now seen corresponding path program 1 times [2025-03-16 20:21:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:15,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291566052] [2025-03-16 20:21:15,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:15,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:21:15,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:21:15,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:15,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291566052] [2025-03-16 20:21:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291566052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006782890] [2025-03-16 20:21:16,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:16,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:16,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:16,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:16,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:21:17,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:21:17,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:21:17,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:17,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:17,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 20:21:17,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:18,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006782890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:20,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 18] total 52 [2025-03-16 20:21:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466782670] [2025-03-16 20:21:20,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:20,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 20:21:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:20,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 20:21:20,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2378, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 20:21:20,106 INFO L87 Difference]: Start difference. First operand 7113 states and 9522 transitions. Second operand has 52 states, 52 states have (on average 3.0576923076923075) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-16 20:21:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:30,949 INFO L93 Difference]: Finished difference Result 15982 states and 20520 transitions. [2025-03-16 20:21:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-03-16 20:21:30,952 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.0576923076923075) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 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-16 20:21:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:30,965 INFO L225 Difference]: With dead ends: 15982 [2025-03-16 20:21:30,965 INFO L226 Difference]: Without dead ends: 13406 [2025-03-16 20:21:30,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3318, Invalid=14772, Unknown=0, NotChecked=0, Total=18090 [2025-03-16 20:21:30,972 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 24391 mSDsluCounter, 32094 mSDsCounter, 0 mSdLazyCounter, 3897 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24391 SdHoareTripleChecker+Valid, 33647 SdHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:30,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24391 Valid, 33647 Invalid, 4018 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [121 Valid, 3897 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 20:21:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13406 states. [2025-03-16 20:21:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13406 to 7705. [2025-03-16 20:21:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7705 states, 7703 states have (on average 1.3351940802284825) internal successors, (10285), 7704 states have internal predecessors, (10285), 0 states have call successors, (0), 0 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-16 20:21:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7705 states to 7705 states and 10285 transitions. [2025-03-16 20:21:31,374 INFO L78 Accepts]: Start accepts. Automaton has 7705 states and 10285 transitions. Word has length 60 [2025-03-16 20:21:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:31,374 INFO L471 AbstractCegarLoop]: Abstraction has 7705 states and 10285 transitions. [2025-03-16 20:21:31,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.0576923076923075) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-16 20:21:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 7705 states and 10285 transitions. [2025-03-16 20:21:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:21:31,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:31,379 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:21:31,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 20:21:31,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:31,580 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:31,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash -639024222, now seen corresponding path program 1 times [2025-03-16 20:21:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:31,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945973846] [2025-03-16 20:21:31,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:31,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:21:31,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:21:31,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:31,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945973846] [2025-03-16 20:21:32,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945973846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218213836] [2025-03-16 20:21:32,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:32,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:32,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:32,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:32,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:21:32,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:21:32,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:21:32,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:32,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:32,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 20:21:32,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:33,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:36,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218213836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:36,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:36,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 22] total 57 [2025-03-16 20:21:36,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117993484] [2025-03-16 20:21:36,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:36,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-16 20:21:36,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:36,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-16 20:21:36,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2861, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 20:21:36,464 INFO L87 Difference]: Start difference. First operand 7705 states and 10285 transitions. Second operand has 57 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 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-16 20:21:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:47,113 INFO L93 Difference]: Finished difference Result 15825 states and 20440 transitions. [2025-03-16 20:21:47,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-16 20:21:47,114 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 20:21:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:47,125 INFO L225 Difference]: With dead ends: 15825 [2025-03-16 20:21:47,125 INFO L226 Difference]: Without dead ends: 12929 [2025-03-16 20:21:47,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7895 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=4305, Invalid=21455, Unknown=0, NotChecked=0, Total=25760 [2025-03-16 20:21:47,133 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 27000 mSDsluCounter, 24417 mSDsCounter, 0 mSdLazyCounter, 3336 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27000 SdHoareTripleChecker+Valid, 25962 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:47,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27000 Valid, 25962 Invalid, 3454 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [118 Valid, 3336 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 20:21:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12929 states. [2025-03-16 20:21:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12929 to 11458. [2025-03-16 20:21:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11458 states, 11456 states have (on average 1.3011522346368716) internal successors, (14906), 11457 states have internal predecessors, (14906), 0 states have call successors, (0), 0 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-16 20:21:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11458 states to 11458 states and 14906 transitions. [2025-03-16 20:21:47,617 INFO L78 Accepts]: Start accepts. Automaton has 11458 states and 14906 transitions. Word has length 97 [2025-03-16 20:21:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:47,617 INFO L471 AbstractCegarLoop]: Abstraction has 11458 states and 14906 transitions. [2025-03-16 20:21:47,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 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-16 20:21:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand 11458 states and 14906 transitions. [2025-03-16 20:21:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:21:47,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:47,619 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:21:47,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 20:21:47,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:47,823 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:47,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2117211932, now seen corresponding path program 1 times [2025-03-16 20:21:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535108699] [2025-03-16 20:21:47,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:47,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:47,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:21:47,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:21:47,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:47,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:48,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535108699] [2025-03-16 20:21:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535108699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951500135] [2025-03-16 20:21:48,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:48,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:48,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:48,980 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:48,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:21:49,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:21:49,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:21:49,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:49,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:49,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-16 20:21:49,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:52,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:58,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951500135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:58,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 73 [2025-03-16 20:21:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973686484] [2025-03-16 20:21:58,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:58,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-16 20:21:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:58,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-16 20:21:58,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=4828, Unknown=0, NotChecked=0, Total=5256 [2025-03-16 20:21:58,527 INFO L87 Difference]: Start difference. First operand 11458 states and 14906 transitions. Second operand has 73 states, 73 states have (on average 3.835616438356164) internal successors, (280), 73 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)