./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.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.5.ufo.UNBOUNDED.pals+Problem12_label00.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 890f1e18995284b0a908a97d5deeec0465d64ba29b3115b90de791926566ed26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:28:05,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:28:05,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:28:05,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:28:05,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:28:05,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:28:05,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:28:05,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:28:05,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:28:05,997 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:28:05,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:28:05,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:28:05,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:28:05,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:28:05,997 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:28:05,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:28:05,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:28:05,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:28:05,999 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:28:06,000 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:28:06,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:28:06,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:28:06,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:28:06,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:28:06,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:28:06,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:28:06,000 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:28:06,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:28:06,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:28:06,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:28:06,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:28:06,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:28:06,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:28:06,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:28:06,001 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 -> 890f1e18995284b0a908a97d5deeec0465d64ba29b3115b90de791926566ed26 [2025-03-16 20:28:06,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:28:06,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:28:06,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:28:06,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:28:06,215 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:28:06,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-16 20:28:07,318 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12cd9949/b3fc399d23564d5b9c38403c67a1976e/FLAGe13f2221f [2025-03-16 20:28:07,690 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:28:07,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-16 20:28:07,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12cd9949/b3fc399d23564d5b9c38403c67a1976e/FLAGe13f2221f [2025-03-16 20:28:07,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12cd9949/b3fc399d23564d5b9c38403c67a1976e [2025-03-16 20:28:07,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:28:07,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:28:07,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:28:07,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:28:07,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:28:07,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:28:07" (1/1) ... [2025-03-16 20:28:07,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ba9601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:07, skipping insertion in model container [2025-03-16 20:28:07,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:28:07" (1/1) ... [2025-03-16 20:28:07,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:28:08,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[11668,11681] [2025-03-16 20:28:08,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[13543,13556] [2025-03-16 20:28:08,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:28:08,511 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:28:08,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[11668,11681] [2025-03-16 20:28:08,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[13543,13556] [2025-03-16 20:28:08,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:28:08,799 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:28:08,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08 WrapperNode [2025-03-16 20:28:08,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:28:08,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:28:08,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:28:08,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:28:08,805 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:28:08" (1/1) ... [2025-03-16 20:28:08,843 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:28:08" (1/1) ... [2025-03-16 20:28:09,085 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5091 [2025-03-16 20:28:09,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:28:09,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:28:09,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:28:09,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:28:09,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,248 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:28:09,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:28:09,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:28:09,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:28:09,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:28:09,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (1/1) ... [2025-03-16 20:28:09,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:28:09,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:09,489 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:28:09,491 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:28:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:28:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:28:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:28:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:28:09,578 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:28:09,579 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:28:12,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2025-03-16 20:28:12,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2025-03-16 20:28:12,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2025-03-16 20:28:12,926 INFO L? ?]: Removed 740 outVars from TransFormulas that were not future-live. [2025-03-16 20:28:12,926 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:28:12,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:28:12,955 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:28:12,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:28:12 BoogieIcfgContainer [2025-03-16 20:28:12,956 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:28:12,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:28:12,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:28:12,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:28:12,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:28:07" (1/3) ... [2025-03-16 20:28:12,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3a51a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:28:12, skipping insertion in model container [2025-03-16 20:28:12,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:08" (2/3) ... [2025-03-16 20:28:12,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3a51a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:28:12, skipping insertion in model container [2025-03-16 20:28:12,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:28:12" (3/3) ... [2025-03-16 20:28:12,965 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-16 20:28:12,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:28:12,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c that has 1 procedures, 836 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:28:13,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:28:13,055 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;@579baa3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:28:13,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:28:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 836 states, 833 states have (on average 1.972388955582233) internal successors, (1643), 835 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states 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:28:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 20:28:13,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:13,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:13,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:13,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash -843088298, now seen corresponding path program 1 times [2025-03-16 20:28:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:13,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593366121] [2025-03-16 20:28:13,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:13,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 20:28:13,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 20:28:13,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:13,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:13,207 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:28:13,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593366121] [2025-03-16 20:28:13,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593366121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:13,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:13,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:28:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049023334] [2025-03-16 20:28:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:13,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:28:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:13,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:28:13,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:28:13,231 INFO L87 Difference]: Start difference. First operand has 836 states, 833 states have (on average 1.972388955582233) internal successors, (1643), 835 states have internal predecessors, (1643), 0 states have call successors, (0), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:28:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:13,289 INFO L93 Difference]: Finished difference Result 1637 states and 3218 transitions. [2025-03-16 20:28:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:28:13,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-16 20:28:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:13,303 INFO L225 Difference]: With dead ends: 1637 [2025-03-16 20:28:13,303 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:28:13,307 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:28:13,309 INFO L435 NwaCegarLoop]: 1578 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, 1578 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:28:13,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:28:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-16 20:28:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8963855421686746) internal successors, (1574), 831 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1574 transitions. [2025-03-16 20:28:13,376 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1574 transitions. Word has length 15 [2025-03-16 20:28:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:13,377 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1574 transitions. [2025-03-16 20:28:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:28:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1574 transitions. [2025-03-16 20:28:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 20:28:13,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:13,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:13,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:28:13,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1984110185, now seen corresponding path program 1 times [2025-03-16 20:28:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:13,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251588058] [2025-03-16 20:28:13,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:13,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 20:28:13,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 20:28:13,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:13,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:13,475 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:28:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:13,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251588058] [2025-03-16 20:28:13,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251588058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:13,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:28:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892862053] [2025-03-16 20:28:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:13,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:13,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:13,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:13,476 INFO L87 Difference]: Start difference. First operand 832 states and 1574 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:28:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:16,034 INFO L93 Difference]: Finished difference Result 2336 states and 4447 transitions. [2025-03-16 20:28:16,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:16,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-16 20:28:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:16,040 INFO L225 Difference]: With dead ends: 2336 [2025-03-16 20:28:16,041 INFO L226 Difference]: Without dead ends: 1583 [2025-03-16 20:28:16,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:16,043 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 938 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:16,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 563 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 20:28:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-16 20:28:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2025-03-16 20:28:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1581 states have (on average 1.6451612903225807) internal successors, (2601), 1582 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states 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:28:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2601 transitions. [2025-03-16 20:28:16,075 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2601 transitions. Word has length 15 [2025-03-16 20:28:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2601 transitions. [2025-03-16 20:28:16,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:28:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2601 transitions. [2025-03-16 20:28:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:28:16,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:16,076 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] [2025-03-16 20:28:16,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:28:16,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:16,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1088994121, now seen corresponding path program 1 times [2025-03-16 20:28:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:16,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41156810] [2025-03-16 20:28:16,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:16,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:16,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:28:16,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:28:16,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:16,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:16,252 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:28:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41156810] [2025-03-16 20:28:16,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41156810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:16,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:16,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:28:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38187364] [2025-03-16 20:28:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:16,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:28:16,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:16,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:28:16,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:28:16,253 INFO L87 Difference]: Start difference. First operand 1583 states and 2601 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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:28:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:16,301 INFO L93 Difference]: Finished difference Result 1629 states and 2673 transitions. [2025-03-16 20:28:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:28:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-16 20:28:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:16,309 INFO L225 Difference]: With dead ends: 1629 [2025-03-16 20:28:16,309 INFO L226 Difference]: Without dead ends: 1583 [2025-03-16 20:28:16,309 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:28:16,342 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 0 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4684 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:16,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4684 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-16 20:28:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2025-03-16 20:28:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1581 states have (on average 1.6255534471853257) internal successors, (2570), 1582 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states 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:28:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2570 transitions. [2025-03-16 20:28:16,378 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2570 transitions. Word has length 21 [2025-03-16 20:28:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:16,379 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2570 transitions. [2025-03-16 20:28:16,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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:28:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2570 transitions. [2025-03-16 20:28:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:28:16,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:16,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:16,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:28:16,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:16,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash -586643669, now seen corresponding path program 1 times [2025-03-16 20:28:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:16,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47220360] [2025-03-16 20:28:16,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:16,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:16,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:28:16,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:28:16,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:16,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:16,551 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:28:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47220360] [2025-03-16 20:28:16,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47220360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:16,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:16,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10416527] [2025-03-16 20:28:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:16,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:16,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:16,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:16,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:16,554 INFO L87 Difference]: Start difference. First operand 1583 states and 2570 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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:28:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:16,731 INFO L93 Difference]: Finished difference Result 2013 states and 3260 transitions. [2025-03-16 20:28:16,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:28:16,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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 51 [2025-03-16 20:28:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:16,738 INFO L225 Difference]: With dead ends: 2013 [2025-03-16 20:28:16,738 INFO L226 Difference]: Without dead ends: 1970 [2025-03-16 20:28:16,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:28:16,741 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 8015 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8015 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:16,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8015 Valid, 2520 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-03-16 20:28:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1624. [2025-03-16 20:28:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states 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:28:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2636 transitions. [2025-03-16 20:28:16,771 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2636 transitions. Word has length 51 [2025-03-16 20:28:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:16,772 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2636 transitions. [2025-03-16 20:28:16,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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:28:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2636 transitions. [2025-03-16 20:28:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:28:16,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:16,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:16,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:28:16,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:16,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:16,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1086667923, now seen corresponding path program 1 times [2025-03-16 20:28:16,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:16,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596039214] [2025-03-16 20:28:16,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:16,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:16,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:28:16,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:28:16,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:16,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:17,022 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:28:17,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:17,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596039214] [2025-03-16 20:28:17,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596039214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:17,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:17,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:17,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96061633] [2025-03-16 20:28:17,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:17,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:17,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:17,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:17,024 INFO L87 Difference]: Start difference. First operand 1624 states and 2636 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:28:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:17,163 INFO L93 Difference]: Finished difference Result 1710 states and 2772 transitions. [2025-03-16 20:28:17,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:17,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:28:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:17,168 INFO L225 Difference]: With dead ends: 1710 [2025-03-16 20:28:17,168 INFO L226 Difference]: Without dead ends: 1626 [2025-03-16 20:28:17,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:28:17,169 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1510 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:17,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1866 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2025-03-16 20:28:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1624. [2025-03-16 20:28:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.624537607891492) internal successors, (2635), 1623 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states 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:28:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2635 transitions. [2025-03-16 20:28:17,193 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2635 transitions. Word has length 53 [2025-03-16 20:28:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:17,193 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2635 transitions. [2025-03-16 20:28:17,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:28:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2635 transitions. [2025-03-16 20:28:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:28:17,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:17,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:17,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:28:17,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:17,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1087710608, now seen corresponding path program 1 times [2025-03-16 20:28:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:17,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93943626] [2025-03-16 20:28:17,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:17,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:28:17,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:28:17,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:17,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:17,273 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:28:17,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93943626] [2025-03-16 20:28:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93943626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:17,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:17,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375328725] [2025-03-16 20:28:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:17,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:17,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:17,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:17,274 INFO L87 Difference]: Start difference. First operand 1624 states and 2635 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:28:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:17,303 INFO L93 Difference]: Finished difference Result 1781 states and 2884 transitions. [2025-03-16 20:28:17,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:17,304 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:28:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:17,309 INFO L225 Difference]: With dead ends: 1781 [2025-03-16 20:28:17,309 INFO L226 Difference]: Without dead ends: 1697 [2025-03-16 20:28:17,310 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:28:17,311 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1601 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:28:17,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1601 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-16 20:28:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1693. [2025-03-16 20:28:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.621525724423418) internal successors, (2742), 1692 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states 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:28:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2742 transitions. [2025-03-16 20:28:17,341 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2742 transitions. Word has length 53 [2025-03-16 20:28:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:17,341 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2742 transitions. [2025-03-16 20:28:17,342 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:28:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2742 transitions. [2025-03-16 20:28:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 20:28:17,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:17,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:17,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:28:17,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:17,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash 674017815, now seen corresponding path program 1 times [2025-03-16 20:28:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:17,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682182388] [2025-03-16 20:28:17,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:17,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 20:28:17,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 20:28:17,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:17,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:17,531 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:28:17,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:17,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682182388] [2025-03-16 20:28:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682182388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:17,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:28:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582573537] [2025-03-16 20:28:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:17,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:28:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:17,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:28:17,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:28:17,533 INFO L87 Difference]: Start difference. First operand 1693 states and 2742 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:17,574 INFO L93 Difference]: Finished difference Result 1699 states and 2749 transitions. [2025-03-16 20:28:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:28:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 20:28:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:17,579 INFO L225 Difference]: With dead ends: 1699 [2025-03-16 20:28:17,579 INFO L226 Difference]: Without dead ends: 1697 [2025-03-16 20:28:17,580 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:28:17,580 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 0 mSDsluCounter, 6145 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7684 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:28:17,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7684 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-16 20:28:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1697. [2025-03-16 20:28:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1695 states have (on average 1.6194690265486726) internal successors, (2745), 1696 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states 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:28:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2745 transitions. [2025-03-16 20:28:17,607 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2745 transitions. Word has length 54 [2025-03-16 20:28:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:17,608 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2745 transitions. [2025-03-16 20:28:17,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2745 transitions. [2025-03-16 20:28:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:17,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:17,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:17,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:28:17,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:17,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash 232477583, now seen corresponding path program 1 times [2025-03-16 20:28:17,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:17,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669676656] [2025-03-16 20:28:17,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:17,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:17,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:17,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:17,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:17,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:17,672 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:28:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669676656] [2025-03-16 20:28:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669676656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:17,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370969726] [2025-03-16 20:28:17,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:17,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:17,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:17,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:17,673 INFO L87 Difference]: Start difference. First operand 1697 states and 2745 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:28:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:17,694 INFO L93 Difference]: Finished difference Result 1995 states and 3205 transitions. [2025-03-16 20:28:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:17,694 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:28:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:17,700 INFO L225 Difference]: With dead ends: 1995 [2025-03-16 20:28:17,700 INFO L226 Difference]: Without dead ends: 1838 [2025-03-16 20:28:17,701 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:28:17,701 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1495 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:17,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-16 20:28:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1836. [2025-03-16 20:28:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1834 states have (on average 1.6117775354416575) internal successors, (2956), 1835 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states 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:28:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2956 transitions. [2025-03-16 20:28:17,730 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2956 transitions. Word has length 55 [2025-03-16 20:28:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:17,731 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2956 transitions. [2025-03-16 20:28:17,731 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:28:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2956 transitions. [2025-03-16 20:28:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:17,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:17,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:17,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:28:17,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:17,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash 989518223, now seen corresponding path program 1 times [2025-03-16 20:28:17,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:17,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571158578] [2025-03-16 20:28:17,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:17,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:17,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:17,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:17,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:17,773 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:28:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571158578] [2025-03-16 20:28:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571158578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:17,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952871314] [2025-03-16 20:28:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:17,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:17,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:17,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:17,775 INFO L87 Difference]: Start difference. First operand 1836 states and 2956 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:28:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:17,798 INFO L93 Difference]: Finished difference Result 2396 states and 3810 transitions. [2025-03-16 20:28:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:17,798 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:28:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:17,804 INFO L225 Difference]: With dead ends: 2396 [2025-03-16 20:28:17,804 INFO L226 Difference]: Without dead ends: 2100 [2025-03-16 20:28:17,805 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:28:17,806 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 1491 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1659 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:28:17,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1659 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-03-16 20:28:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2098. [2025-03-16 20:28:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2096 states have (on average 1.5963740458015268) internal successors, (3346), 2097 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states 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:28:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 3346 transitions. [2025-03-16 20:28:17,870 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 3346 transitions. Word has length 55 [2025-03-16 20:28:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:17,870 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 3346 transitions. [2025-03-16 20:28:17,870 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:28:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 3346 transitions. [2025-03-16 20:28:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:17,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:17,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:17,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:28:17,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:17,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash 439729295, now seen corresponding path program 1 times [2025-03-16 20:28:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:17,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986458709] [2025-03-16 20:28:17,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:17,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:17,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:17,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:17,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:17,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:28:17,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:17,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986458709] [2025-03-16 20:28:17,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986458709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:17,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:17,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201908049] [2025-03-16 20:28:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:17,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:17,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:17,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:17,916 INFO L87 Difference]: Start difference. First operand 2098 states and 3346 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:28:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:17,944 INFO L93 Difference]: Finished difference Result 3150 states and 4924 transitions. [2025-03-16 20:28:17,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:17,944 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:28:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:17,951 INFO L225 Difference]: With dead ends: 3150 [2025-03-16 20:28:17,951 INFO L226 Difference]: Without dead ends: 2592 [2025-03-16 20:28:17,952 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:28:17,953 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 1489 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1661 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:28:17,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1661 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2025-03-16 20:28:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2590. [2025-03-16 20:28:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2588 states have (on average 1.5695517774343122) internal successors, (4062), 2589 states have internal predecessors, (4062), 0 states have call successors, (0), 0 states 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:28:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4062 transitions. [2025-03-16 20:28:17,995 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4062 transitions. Word has length 55 [2025-03-16 20:28:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:17,995 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 4062 transitions. [2025-03-16 20:28:17,996 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:28:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4062 transitions. [2025-03-16 20:28:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:17,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:17,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:17,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:28:17,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:17,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1055700623, now seen corresponding path program 1 times [2025-03-16 20:28:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:17,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882262077] [2025-03-16 20:28:17,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:18,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:18,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:18,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:18,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:18,037 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:28:18,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:18,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882262077] [2025-03-16 20:28:18,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882262077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:18,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:18,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:18,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385491724] [2025-03-16 20:28:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:18,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:18,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:18,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:18,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:18,038 INFO L87 Difference]: Start difference. First operand 2590 states and 4062 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:28:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:18,074 INFO L93 Difference]: Finished difference Result 4562 states and 6960 transitions. [2025-03-16 20:28:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:18,074 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:28:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:18,084 INFO L225 Difference]: With dead ends: 4562 [2025-03-16 20:28:18,084 INFO L226 Difference]: Without dead ends: 3512 [2025-03-16 20:28:18,086 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:28:18,086 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1493 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1665 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:28:18,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1665 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2025-03-16 20:28:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3510. [2025-03-16 20:28:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 3508 states have (on average 1.5296465222348916) internal successors, (5366), 3509 states have internal predecessors, (5366), 0 states have call successors, (0), 0 states 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:28:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5366 transitions. [2025-03-16 20:28:18,150 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5366 transitions. Word has length 55 [2025-03-16 20:28:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:18,150 INFO L471 AbstractCegarLoop]: Abstraction has 3510 states and 5366 transitions. [2025-03-16 20:28:18,150 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:28:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5366 transitions. [2025-03-16 20:28:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:28:18,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:18,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:18,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:28:18,151 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:18,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash -441912209, now seen corresponding path program 1 times [2025-03-16 20:28:18,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:18,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863308298] [2025-03-16 20:28:18,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:18,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:18,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:28:18,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:28:18,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:18,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:18,191 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:28:18,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863308298] [2025-03-16 20:28:18,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863308298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:18,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:18,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:18,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360119224] [2025-03-16 20:28:18,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:18,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:18,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:18,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:18,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:18,192 INFO L87 Difference]: Start difference. First operand 3510 states and 5366 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:18,236 INFO L93 Difference]: Finished difference Result 5565 states and 8412 transitions. [2025-03-16 20:28:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:18,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 20:28:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:18,249 INFO L225 Difference]: With dead ends: 5565 [2025-03-16 20:28:18,249 INFO L226 Difference]: Without dead ends: 4442 [2025-03-16 20:28:18,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:18,252 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 1494 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1664 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:28:18,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1664 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2025-03-16 20:28:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4440. [2025-03-16 20:28:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 4438 states have (on average 1.5087877422262281) internal successors, (6696), 4439 states have internal predecessors, (6696), 0 states have call successors, (0), 0 states 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:28:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6696 transitions. [2025-03-16 20:28:18,343 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6696 transitions. Word has length 57 [2025-03-16 20:28:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:18,344 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 6696 transitions. [2025-03-16 20:28:18,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6696 transitions. [2025-03-16 20:28:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:18,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:18,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:18,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:28:18,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:18,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:18,350 INFO L85 PathProgramCache]: Analyzing trace with hash 289567166, now seen corresponding path program 1 times [2025-03-16 20:28:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:18,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53393040] [2025-03-16 20:28:18,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:18,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:18,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:18,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:18,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:28:18,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:18,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53393040] [2025-03-16 20:28:18,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53393040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:18,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:18,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:18,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186988877] [2025-03-16 20:28:18,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:18,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:18,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:18,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:18,484 INFO L87 Difference]: Start difference. First operand 4440 states and 6696 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:18,782 INFO L93 Difference]: Finished difference Result 19540 states and 28510 transitions. [2025-03-16 20:28:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 20:28:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:18,816 INFO L225 Difference]: With dead ends: 19540 [2025-03-16 20:28:18,817 INFO L226 Difference]: Without dead ends: 16642 [2025-03-16 20:28:18,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:18,822 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6368 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6368 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:18,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6368 Valid, 3533 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16642 states. [2025-03-16 20:28:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 7336. [2025-03-16 20:28:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7336 states, 7334 states have (on average 1.478047450231797) internal successors, (10840), 7335 states have internal predecessors, (10840), 0 states have call successors, (0), 0 states 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:28:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7336 states to 7336 states and 10840 transitions. [2025-03-16 20:28:19,020 INFO L78 Accepts]: Start accepts. Automaton has 7336 states and 10840 transitions. Word has length 73 [2025-03-16 20:28:19,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:19,020 INFO L471 AbstractCegarLoop]: Abstraction has 7336 states and 10840 transitions. [2025-03-16 20:28:19,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 7336 states and 10840 transitions. [2025-03-16 20:28:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:19,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:19,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:19,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:28:19,023 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:19,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1046607806, now seen corresponding path program 1 times [2025-03-16 20:28:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:19,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853740400] [2025-03-16 20:28:19,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:19,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:19,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:19,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:19,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:19,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:28:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853740400] [2025-03-16 20:28:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853740400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:19,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635062446] [2025-03-16 20:28:19,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:19,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:19,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:19,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:19,151 INFO L87 Difference]: Start difference. First operand 7336 states and 10840 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:28:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:19,417 INFO L93 Difference]: Finished difference Result 22436 states and 32654 transitions. [2025-03-16 20:28:19,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:19,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 73 [2025-03-16 20:28:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:19,451 INFO L225 Difference]: With dead ends: 22436 [2025-03-16 20:28:19,451 INFO L226 Difference]: Without dead ends: 19538 [2025-03-16 20:28:19,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:19,462 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 6410 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6410 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:19,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6410 Valid, 3525 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19538 states. [2025-03-16 20:28:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19538 to 11688. [2025-03-16 20:28:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11688 states, 11686 states have (on average 1.4561013178161903) internal successors, (17016), 11687 states have internal predecessors, (17016), 0 states have call successors, (0), 0 states 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:28:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11688 states to 11688 states and 17016 transitions. [2025-03-16 20:28:19,867 INFO L78 Accepts]: Start accepts. Automaton has 11688 states and 17016 transitions. Word has length 73 [2025-03-16 20:28:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:19,867 INFO L471 AbstractCegarLoop]: Abstraction has 11688 states and 17016 transitions. [2025-03-16 20:28:19,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:28:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 11688 states and 17016 transitions. [2025-03-16 20:28:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:19,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:19,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:19,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:28:19,870 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:19,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash 496818878, now seen corresponding path program 1 times [2025-03-16 20:28:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948613087] [2025-03-16 20:28:19,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:19,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:19,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:19,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:19,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:19,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:28:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948613087] [2025-03-16 20:28:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948613087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:20,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:20,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:20,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13626173] [2025-03-16 20:28:20,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:20,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:20,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:20,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:20,021 INFO L87 Difference]: Start difference. First operand 11688 states and 17016 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:28:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:20,333 INFO L93 Difference]: Finished difference Result 25332 states and 36798 transitions. [2025-03-16 20:28:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:20,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 73 [2025-03-16 20:28:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:20,369 INFO L225 Difference]: With dead ends: 25332 [2025-03-16 20:28:20,369 INFO L226 Difference]: Without dead ends: 22434 [2025-03-16 20:28:20,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:20,380 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6369 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6369 SdHoareTripleChecker+Valid, 3541 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:20,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6369 Valid, 3541 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2025-03-16 20:28:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 14584. [2025-03-16 20:28:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14584 states, 14582 states have (on average 1.4511041009463723) internal successors, (21160), 14583 states have internal predecessors, (21160), 0 states have call successors, (0), 0 states 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:28:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14584 states to 14584 states and 21160 transitions. [2025-03-16 20:28:20,702 INFO L78 Accepts]: Start accepts. Automaton has 14584 states and 21160 transitions. Word has length 73 [2025-03-16 20:28:20,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:20,702 INFO L471 AbstractCegarLoop]: Abstraction has 14584 states and 21160 transitions. [2025-03-16 20:28:20,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:28:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 14584 states and 21160 transitions. [2025-03-16 20:28:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:20,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:20,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:20,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:28:20,704 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:20,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1112790206, now seen corresponding path program 1 times [2025-03-16 20:28:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931580098] [2025-03-16 20:28:20,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:20,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:20,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:20,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:20,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:28:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931580098] [2025-03-16 20:28:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931580098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:20,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856480557] [2025-03-16 20:28:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:20,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:20,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:20,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:20,811 INFO L87 Difference]: Start difference. First operand 14584 states and 21160 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:21,141 INFO L93 Difference]: Finished difference Result 28228 states and 40942 transitions. [2025-03-16 20:28:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:21,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 20:28:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:21,184 INFO L225 Difference]: With dead ends: 28228 [2025-03-16 20:28:21,184 INFO L226 Difference]: Without dead ends: 25330 [2025-03-16 20:28:21,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:21,197 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6317 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6317 SdHoareTripleChecker+Valid, 3607 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:21,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6317 Valid, 3607 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25330 states. [2025-03-16 20:28:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25330 to 17480. [2025-03-16 20:28:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17480 states, 17478 states have (on average 1.4477629019338598) internal successors, (25304), 17479 states have internal predecessors, (25304), 0 states have call successors, (0), 0 states 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:28:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17480 states to 17480 states and 25304 transitions. [2025-03-16 20:28:21,559 INFO L78 Accepts]: Start accepts. Automaton has 17480 states and 25304 transitions. Word has length 73 [2025-03-16 20:28:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:21,559 INFO L471 AbstractCegarLoop]: Abstraction has 17480 states and 25304 transitions. [2025-03-16 20:28:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 17480 states and 25304 transitions. [2025-03-16 20:28:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:28:21,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:21,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:21,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:28:21,561 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:21,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash -861645504, now seen corresponding path program 1 times [2025-03-16 20:28:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072328460] [2025-03-16 20:28:21,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:21,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:28:21,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:28:21,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:21,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:21,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:21,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072328460] [2025-03-16 20:28:21,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072328460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:21,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:21,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146421471] [2025-03-16 20:28:21,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:21,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:21,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:21,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:21,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:21,639 INFO L87 Difference]: Start difference. First operand 17480 states and 25304 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:28:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:21,781 INFO L93 Difference]: Finished difference Result 28767 states and 41694 transitions. [2025-03-16 20:28:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:21,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-16 20:28:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:21,801 INFO L225 Difference]: With dead ends: 28767 [2025-03-16 20:28:21,801 INFO L226 Difference]: Without dead ends: 12829 [2025-03-16 20:28:21,814 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:28:21,815 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 50 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3111 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:28:21,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3111 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2025-03-16 20:28:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 12827. [2025-03-16 20:28:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12827 states, 12825 states have (on average 1.4592592592592593) internal successors, (18715), 12826 states have internal predecessors, (18715), 0 states have call successors, (0), 0 states 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:28:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12827 states to 12827 states and 18715 transitions. [2025-03-16 20:28:22,098 INFO L78 Accepts]: Start accepts. Automaton has 12827 states and 18715 transitions. Word has length 75 [2025-03-16 20:28:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:22,098 INFO L471 AbstractCegarLoop]: Abstraction has 12827 states and 18715 transitions. [2025-03-16 20:28:22,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:28:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 12827 states and 18715 transitions. [2025-03-16 20:28:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:28:22,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:22,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:22,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:28:22,100 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1413397794, now seen corresponding path program 1 times [2025-03-16 20:28:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:22,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541891473] [2025-03-16 20:28:22,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:22,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:28:22,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:28:22,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:22,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:28:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:22,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541891473] [2025-03-16 20:28:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541891473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:22,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:22,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:22,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800796069] [2025-03-16 20:28:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:22,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:22,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:22,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:22,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:22,201 INFO L87 Difference]: Start difference. First operand 12827 states and 18715 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:22,515 INFO L93 Difference]: Finished difference Result 23079 states and 33601 transitions. [2025-03-16 20:28:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:22,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 20:28:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:22,550 INFO L225 Difference]: With dead ends: 23079 [2025-03-16 20:28:22,551 INFO L226 Difference]: Without dead ends: 21029 [2025-03-16 20:28:22,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:22,560 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6369 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6369 SdHoareTripleChecker+Valid, 3636 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:22,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6369 Valid, 3636 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21029 states. [2025-03-16 20:28:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21029 to 14875. [2025-03-16 20:28:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14875 states, 14873 states have (on average 1.4562630269616084) internal successors, (21659), 14874 states have internal predecessors, (21659), 0 states have call successors, (0), 0 states 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:28:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14875 states to 14875 states and 21659 transitions. [2025-03-16 20:28:22,956 INFO L78 Accepts]: Start accepts. Automaton has 14875 states and 21659 transitions. Word has length 75 [2025-03-16 20:28:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:22,956 INFO L471 AbstractCegarLoop]: Abstraction has 14875 states and 21659 transitions. [2025-03-16 20:28:22,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 14875 states and 21659 transitions. [2025-03-16 20:28:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:28:22,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:22,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:22,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:28:22,959 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:22,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:22,959 INFO L85 PathProgramCache]: Analyzing trace with hash 936423678, now seen corresponding path program 1 times [2025-03-16 20:28:22,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:22,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585882050] [2025-03-16 20:28:22,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:22,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:22,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:28:22,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:28:22,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:22,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:23,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:23,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585882050] [2025-03-16 20:28:23,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585882050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:23,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:23,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384232372] [2025-03-16 20:28:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:23,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:23,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:23,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:23,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:23,047 INFO L87 Difference]: Start difference. First operand 14875 states and 21659 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:23,209 INFO L93 Difference]: Finished difference Result 21535 states and 31229 transitions. [2025-03-16 20:28:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:23,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:28:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:23,225 INFO L225 Difference]: With dead ends: 21535 [2025-03-16 20:28:23,225 INFO L226 Difference]: Without dead ends: 8221 [2025-03-16 20:28:23,237 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:28:23,238 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 45 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3096 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:28:23,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3096 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8221 states. [2025-03-16 20:28:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8221 to 8219. [2025-03-16 20:28:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8219 states, 8217 states have (on average 1.458804916636242) internal successors, (11987), 8218 states have internal predecessors, (11987), 0 states have call successors, (0), 0 states 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:28:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8219 states to 8219 states and 11987 transitions. [2025-03-16 20:28:23,441 INFO L78 Accepts]: Start accepts. Automaton has 8219 states and 11987 transitions. Word has length 76 [2025-03-16 20:28:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:23,442 INFO L471 AbstractCegarLoop]: Abstraction has 8219 states and 11987 transitions. [2025-03-16 20:28:23,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 8219 states and 11987 transitions. [2025-03-16 20:28:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:28:23,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:23,443 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:28:23,444 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:23,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1884587529, now seen corresponding path program 1 times [2025-03-16 20:28:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:23,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314201251] [2025-03-16 20:28:23,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:23,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:28:23,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:28:23,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:23,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:23,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314201251] [2025-03-16 20:28:23,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314201251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:23,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:23,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611855083] [2025-03-16 20:28:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:23,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:23,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:23,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:23,525 INFO L87 Difference]: Start difference. First operand 8219 states and 11987 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:23,612 INFO L93 Difference]: Finished difference Result 11551 states and 16721 transitions. [2025-03-16 20:28:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:28:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:23,622 INFO L225 Difference]: With dead ends: 11551 [2025-03-16 20:28:23,622 INFO L226 Difference]: Without dead ends: 4893 [2025-03-16 20:28:23,627 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:28:23,628 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 42 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3081 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:28:23,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3081 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2025-03-16 20:28:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4891. [2025-03-16 20:28:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4889 states have (on average 1.4733074248312539) internal successors, (7203), 4890 states have internal predecessors, (7203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 7203 transitions. [2025-03-16 20:28:23,739 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 7203 transitions. Word has length 78 [2025-03-16 20:28:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:23,740 INFO L471 AbstractCegarLoop]: Abstraction has 4891 states and 7203 transitions. [2025-03-16 20:28:23,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 7203 transitions. [2025-03-16 20:28:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 20:28:23,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:23,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:23,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:28:23,742 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:23,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1516299760, now seen corresponding path program 1 times [2025-03-16 20:28:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:23,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493958698] [2025-03-16 20:28:23,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:23,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 20:28:23,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 20:28:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:23,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493958698] [2025-03-16 20:28:23,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493958698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:23,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:23,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:23,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244207545] [2025-03-16 20:28:23,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:23,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:23,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:23,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:23,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:23,825 INFO L87 Difference]: Start difference. First operand 4891 states and 7203 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:23,879 INFO L93 Difference]: Finished difference Result 6559 states and 9545 transitions. [2025-03-16 20:28:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:23,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 20:28:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:23,887 INFO L225 Difference]: With dead ends: 6559 [2025-03-16 20:28:23,887 INFO L226 Difference]: Without dead ends: 3229 [2025-03-16 20:28:23,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:23,891 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 39 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3066 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:28:23,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3066 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2025-03-16 20:28:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3227. [2025-03-16 20:28:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3225 states have (on average 1.49984496124031) internal successors, (4837), 3226 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states 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:28:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4837 transitions. [2025-03-16 20:28:23,958 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4837 transitions. Word has length 80 [2025-03-16 20:28:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:23,959 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 4837 transitions. [2025-03-16 20:28:23,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4837 transitions. [2025-03-16 20:28:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:28:23,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:23,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:23,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:28:23,960 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:23,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash -260930327, now seen corresponding path program 1 times [2025-03-16 20:28:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726030049] [2025-03-16 20:28:23,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:23,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:28:23,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:28:23,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:23,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:24,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726030049] [2025-03-16 20:28:24,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726030049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:24,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:24,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:24,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948503491] [2025-03-16 20:28:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:24,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:24,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:24,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:24,044 INFO L87 Difference]: Start difference. First operand 3227 states and 4837 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:24,083 INFO L93 Difference]: Finished difference Result 4063 states and 5996 transitions. [2025-03-16 20:28:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:24,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 20:28:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:24,088 INFO L225 Difference]: With dead ends: 4063 [2025-03-16 20:28:24,089 INFO L226 Difference]: Without dead ends: 2397 [2025-03-16 20:28:24,091 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:28:24,093 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 36 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3051 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:28:24,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3051 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-16 20:28:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2395. [2025-03-16 20:28:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2393 states have (on average 1.532386126201421) internal successors, (3667), 2394 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states 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:28:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3667 transitions. [2025-03-16 20:28:24,136 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3667 transitions. Word has length 82 [2025-03-16 20:28:24,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:24,137 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3667 transitions. [2025-03-16 20:28:24,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3667 transitions. [2025-03-16 20:28:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 20:28:24,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:24,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:24,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:28:24,138 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:24,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:24,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1013848350, now seen corresponding path program 1 times [2025-03-16 20:28:24,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:24,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610023448] [2025-03-16 20:28:24,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:24,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:28:24,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:28:24,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:24,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:24,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:24,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610023448] [2025-03-16 20:28:24,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610023448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351821028] [2025-03-16 20:28:24,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:24,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:24,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:24,988 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:28:24,989 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:28:25,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:28:25,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:28:25,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:25,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:25,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 20:28:25,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:25,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351821028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:25,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:25,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:28:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936555838] [2025-03-16 20:28:25,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:25,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:28:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:25,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:28:25,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:28:25,658 INFO L87 Difference]: Start difference. First operand 2395 states and 3667 transitions. Second operand has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:28:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:28,826 INFO L93 Difference]: Finished difference Result 10265 states and 14300 transitions. [2025-03-16 20:28:28,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:28:28,827 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 20:28:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:28,838 INFO L225 Difference]: With dead ends: 10265 [2025-03-16 20:28:28,838 INFO L226 Difference]: Without dead ends: 9345 [2025-03-16 20:28:28,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2659 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1242, Invalid=6948, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 20:28:28,843 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 16811 mSDsluCounter, 8333 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16811 SdHoareTripleChecker+Valid, 9861 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:28,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16811 Valid, 9861 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 20:28:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9345 states. [2025-03-16 20:28:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9345 to 8787. [2025-03-16 20:28:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8787 states, 8785 states have (on average 1.3813318155947638) internal successors, (12135), 8786 states have internal predecessors, (12135), 0 states have call successors, (0), 0 states 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:28:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8787 states to 8787 states and 12135 transitions. [2025-03-16 20:28:29,000 INFO L78 Accepts]: Start accepts. Automaton has 8787 states and 12135 transitions. Word has length 84 [2025-03-16 20:28:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:29,001 INFO L471 AbstractCegarLoop]: Abstraction has 8787 states and 12135 transitions. [2025-03-16 20:28:29,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:28:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 8787 states and 12135 transitions. [2025-03-16 20:28:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:28:29,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:29,002 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, 1, 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:28:29,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:28:29,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 20:28:29,206 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:29,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1253413577, now seen corresponding path program 1 times [2025-03-16 20:28:29,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:29,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666339558] [2025-03-16 20:28:29,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:29,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:29,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:29,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:29,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:29,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:29,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:29,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666339558] [2025-03-16 20:28:29,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666339558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:29,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081924563] [2025-03-16 20:28:29,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:29,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:29,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:29,485 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:28:29,486 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:28:29,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:29,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:29,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:29,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:29,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:28:29,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:30,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:31,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081924563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:31,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 32 [2025-03-16 20:28:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289752819] [2025-03-16 20:28:31,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:31,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 20:28:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:31,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 20:28:31,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:28:31,565 INFO L87 Difference]: Start difference. First operand 8787 states and 12135 transitions. Second operand has 32 states, 32 states have (on average 7.1875) internal successors, (230), 32 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:28:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:35,500 INFO L93 Difference]: Finished difference Result 44219 states and 59272 transitions. [2025-03-16 20:28:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-16 20:28:35,501 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.1875) internal successors, (230), 32 states have internal predecessors, (230), 0 states have call successors, (0), 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 85 [2025-03-16 20:28:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:35,564 INFO L225 Difference]: With dead ends: 44219 [2025-03-16 20:28:35,565 INFO L226 Difference]: Without dead ends: 37071 [2025-03-16 20:28:35,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1457, Invalid=5853, Unknown=0, NotChecked=0, Total=7310 [2025-03-16 20:28:35,587 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 22987 mSDsluCounter, 8125 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22987 SdHoareTripleChecker+Valid, 9627 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:35,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22987 Valid, 9627 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:28:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37071 states. [2025-03-16 20:28:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37071 to 36933. [2025-03-16 20:28:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36933 states, 36931 states have (on average 1.3159134602366576) internal successors, (48598), 36932 states have internal predecessors, (48598), 0 states have call successors, (0), 0 states 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:28:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36933 states to 36933 states and 48598 transitions. [2025-03-16 20:28:36,623 INFO L78 Accepts]: Start accepts. Automaton has 36933 states and 48598 transitions. Word has length 85 [2025-03-16 20:28:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:36,624 INFO L471 AbstractCegarLoop]: Abstraction has 36933 states and 48598 transitions. [2025-03-16 20:28:36,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.1875) internal successors, (230), 32 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:28:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 36933 states and 48598 transitions. [2025-03-16 20:28:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:28:36,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:36,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:36,636 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:28:36,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 20:28:36,826 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:36,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1696579719, now seen corresponding path program 1 times [2025-03-16 20:28:36,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:36,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208097891] [2025-03-16 20:28:36,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:36,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:36,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:28:36,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:28:36,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:36,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:36,880 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:28:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:36,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208097891] [2025-03-16 20:28:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208097891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:36,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:36,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106496841] [2025-03-16 20:28:36,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:36,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:36,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:36,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:36,882 INFO L87 Difference]: Start difference. First operand 36933 states and 48598 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:28:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:40,148 INFO L93 Difference]: Finished difference Result 39939 states and 53525 transitions. [2025-03-16 20:28:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:40,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:28:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:40,186 INFO L225 Difference]: With dead ends: 39939 [2025-03-16 20:28:40,186 INFO L226 Difference]: Without dead ends: 38435 [2025-03-16 20:28:40,193 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:28:40,194 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 753 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:40,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1365 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 20:28:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38435 states. [2025-03-16 20:28:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38435 to 38435. [2025-03-16 20:28:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38435 states, 38433 states have (on average 1.3205838732339397) internal successors, (50754), 38434 states have internal predecessors, (50754), 0 states have call successors, (0), 0 states 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:28:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38435 states to 38435 states and 50754 transitions. [2025-03-16 20:28:41,409 INFO L78 Accepts]: Start accepts. Automaton has 38435 states and 50754 transitions. Word has length 86 [2025-03-16 20:28:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:41,409 INFO L471 AbstractCegarLoop]: Abstraction has 38435 states and 50754 transitions. [2025-03-16 20:28:41,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:28:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 38435 states and 50754 transitions. [2025-03-16 20:28:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:28:41,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:41,411 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, 1, 1, 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:28:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:28:41,411 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:41,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -867561235, now seen corresponding path program 1 times [2025-03-16 20:28:41,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:41,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496615576] [2025-03-16 20:28:41,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:41,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:28:41,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:28:41,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:41,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496615576] [2025-03-16 20:28:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496615576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796396174] [2025-03-16 20:28:42,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:42,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:42,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:42,062 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:28:42,063 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:28:42,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:28:42,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:28:42,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:42,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:28:42,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:42,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:42,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796396174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:42,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:42,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-16 20:28:42,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754322573] [2025-03-16 20:28:42,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:42,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:28:42,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:42,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:28:42,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:28:42,919 INFO L87 Difference]: Start difference. First operand 38435 states and 50754 transitions. Second operand has 28 states, 28 states have (on average 8.214285714285714) internal successors, (230), 27 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:28:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:45,810 INFO L93 Difference]: Finished difference Result 121855 states and 159207 transitions. [2025-03-16 20:28:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-16 20:28:45,811 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.214285714285714) internal successors, (230), 27 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:28:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:45,894 INFO L225 Difference]: With dead ends: 121855 [2025-03-16 20:28:45,894 INFO L226 Difference]: Without dead ends: 90039 [2025-03-16 20:28:45,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=695, Invalid=3087, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 20:28:45,924 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 17863 mSDsluCounter, 9673 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17863 SdHoareTripleChecker+Valid, 11191 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:45,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17863 Valid, 11191 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:28:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90039 states. [2025-03-16 20:28:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90039 to 75195. [2025-03-16 20:28:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75195 states, 75193 states have (on average 1.2980729589190483) internal successors, (97606), 75194 states have internal predecessors, (97606), 0 states have call successors, (0), 0 states 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:28:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75195 states to 75195 states and 97606 transitions. [2025-03-16 20:28:48,014 INFO L78 Accepts]: Start accepts. Automaton has 75195 states and 97606 transitions. Word has length 86 [2025-03-16 20:28:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:48,015 INFO L471 AbstractCegarLoop]: Abstraction has 75195 states and 97606 transitions. [2025-03-16 20:28:48,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.214285714285714) internal successors, (230), 27 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:28:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 75195 states and 97606 transitions. [2025-03-16 20:28:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:28:48,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:48,016 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, 1, 1, 1, 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:28:48,023 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:28:48,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:48,221 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:48,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:48,221 INFO L85 PathProgramCache]: Analyzing trace with hash 403796273, now seen corresponding path program 1 times [2025-03-16 20:28:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:48,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182975422] [2025-03-16 20:28:48,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:48,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:28:48,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:28:48,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:48,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:48,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:48,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182975422] [2025-03-16 20:28:48,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182975422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:48,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139407817] [2025-03-16 20:28:48,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:48,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:48,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:48,509 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:28:48,511 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:28:48,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:28:48,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:28:48,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:48,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:48,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-16 20:28:48,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:53,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:57,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139407817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:57,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:57,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 23] total 53 [2025-03-16 20:28:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146489663] [2025-03-16 20:28:57,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:57,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 20:28:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:57,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 20:28:57,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2307, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 20:28:57,671 INFO L87 Difference]: Start difference. First operand 75195 states and 97606 transitions. Second operand has 53 states, 53 states have (on average 4.60377358490566) internal successors, (244), 53 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:29:02,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:29:06,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:29:10,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:29:14,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:29:20,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:29:24,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]