./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-86.i --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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-86.i -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 ce9fa65ad297a46fd1c0c7bb56056c5a0304efd02803c9735a082016b49852e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:16:45,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:16:45,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:16:45,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:16:45,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:16:45,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:16:45,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:16:45,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:16:45,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:16:45,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:16:45,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:16:45,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:16:45,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:16:45,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:16:45,616 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:16:45,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:16:45,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:16:45,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:16:45,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:16:45,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:16:45,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:16:45,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:16:45,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:16:45,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:16:45,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:16:45,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:16:45,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:16:45,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:16:45,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:16:45,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:16:45,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:16:45,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:16:45,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:16:45,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:16:45,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:16:45,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:16:45,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:16:45,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:16:45,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:16:45,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:16:45,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:16:45,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:16:45,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:16:45,619 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 -> ce9fa65ad297a46fd1c0c7bb56056c5a0304efd02803c9735a082016b49852e1 [2025-03-17 01:16:45,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:16:45,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:16:45,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:16:45,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:16:45,876 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:16:45,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-86.i [2025-03-17 01:16:47,084 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e73591fa/ada56803f67e4ee7972dc0dc4a7dcf0f/FLAG1753ecf29 [2025-03-17 01:16:47,371 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:16:47,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-86.i [2025-03-17 01:16:47,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e73591fa/ada56803f67e4ee7972dc0dc4a7dcf0f/FLAG1753ecf29 [2025-03-17 01:16:47,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e73591fa/ada56803f67e4ee7972dc0dc4a7dcf0f [2025-03-17 01:16:47,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:16:47,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:16:47,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:16:47,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:16:47,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:16:47,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:47,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c5f70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47, skipping insertion in model container [2025-03-17 01:16:47,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:47,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:16:47,809 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-86.i[919,932] [2025-03-17 01:16:47,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:16:47,886 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:16:47,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-86.i[919,932] [2025-03-17 01:16:47,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:16:47,946 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:16:47,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47 WrapperNode [2025-03-17 01:16:47,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:16:47,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:16:47,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:16:47,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:16:47,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:47,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:47,998 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-17 01:16:47,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:16:47,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:16:47,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:16:47,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:16:48,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,031 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-17 01:16:48,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:16:48,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:16:48,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:16:48,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:16:48,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (1/1) ... [2025-03-17 01:16:48,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:16:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:16:48,089 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-17 01:16:48,095 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-17 01:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:16:48,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:16:48,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:16:48,187 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:16:48,189 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:16:48,511 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-17 01:16:48,511 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:16:48,526 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:16:48,527 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:16:48,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:16:48 BoogieIcfgContainer [2025-03-17 01:16:48,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:16:48,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:16:48,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:16:48,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:16:48,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:16:47" (1/3) ... [2025-03-17 01:16:48,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6189d2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:16:48, skipping insertion in model container [2025-03-17 01:16:48,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:16:47" (2/3) ... [2025-03-17 01:16:48,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6189d2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:16:48, skipping insertion in model container [2025-03-17 01:16:48,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:16:48" (3/3) ... [2025-03-17 01:16:48,536 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-86.i [2025-03-17 01:16:48,547 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:16:48,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-86.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:16:48,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:16:48,608 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;@542a9f80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:16:48,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:16:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 62 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 01:16:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 01:16:48,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:16:48,621 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:16:48,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:16:48,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:16:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1733634730, now seen corresponding path program 1 times [2025-03-17 01:16:48,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:16:48,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343299397] [2025-03-17 01:16:48,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:16:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:16:48,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 01:16:48,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 01:16:48,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:16:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:16:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-17 01:16:48,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:16:48,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343299397] [2025-03-17 01:16:48,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343299397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:16:48,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297668196] [2025-03-17 01:16:48,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:16:48,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:16:48,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:16:48,895 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-17 01:16:48,915 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-17 01:16:48,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 01:16:49,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 01:16:49,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:16:49,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:16:49,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:16:49,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:16:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-17 01:16:49,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:16:49,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297668196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:16:49,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:16:49,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:16:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904482992] [2025-03-17 01:16:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:16:49,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:16:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:16:49,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:16:49,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:16:49,138 INFO L87 Difference]: Start difference. First operand has 91 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 62 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 01:16:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:16:49,166 INFO L93 Difference]: Finished difference Result 179 states and 319 transitions. [2025-03-17 01:16:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:16:49,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2025-03-17 01:16:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:16:49,175 INFO L225 Difference]: With dead ends: 179 [2025-03-17 01:16:49,175 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 01:16:49,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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-17 01:16:49,180 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:16:49,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:16:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 01:16:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 01:16:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 60 states have internal predecessors, (88), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 01:16:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 142 transitions. [2025-03-17 01:16:49,216 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 142 transitions. Word has length 170 [2025-03-17 01:16:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:16:49,216 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 142 transitions. [2025-03-17 01:16:49,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 01:16:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2025-03-17 01:16:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 01:16:49,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:16:49,219 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:16:49,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:16:49,421 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,SelfDestructingSolverStorable0 [2025-03-17 01:16:49,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:16:49,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:16:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1882417547, now seen corresponding path program 1 times [2025-03-17 01:16:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:16:49,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609616978] [2025-03-17 01:16:49,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:16:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:16:49,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 01:16:49,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 01:16:49,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:16:49,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:16:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:16:49,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:16:49,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609616978] [2025-03-17 01:16:49,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609616978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:16:49,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:16:49,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:16:49,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594460116] [2025-03-17 01:16:49,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:16:49,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:16:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:16:49,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:16:49,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:16:49,720 INFO L87 Difference]: Start difference. First operand 89 states and 142 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:16:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:16:49,770 INFO L93 Difference]: Finished difference Result 178 states and 285 transitions. [2025-03-17 01:16:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:16:49,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-17 01:16:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:16:49,774 INFO L225 Difference]: With dead ends: 178 [2025-03-17 01:16:49,774 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 01:16:49,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:16:49,775 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:16:49,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:16:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 01:16:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 01:16:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 61 states have internal predecessors, (89), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 01:16:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 143 transitions. [2025-03-17 01:16:49,816 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 143 transitions. Word has length 170 [2025-03-17 01:16:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:16:49,818 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 143 transitions. [2025-03-17 01:16:49,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:16:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 143 transitions. [2025-03-17 01:16:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 01:16:49,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:16:49,823 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:16:49,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:16:49,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:16:49,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:16:49,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1911046698, now seen corresponding path program 1 times [2025-03-17 01:16:49,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:16:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467439385] [2025-03-17 01:16:49,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:16:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:16:49,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 01:16:49,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 01:16:49,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:16:49,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:16:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:16:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:16:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467439385] [2025-03-17 01:16:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467439385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:16:50,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:16:50,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:16:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336786608] [2025-03-17 01:16:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:16:50,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:16:50,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:16:50,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:16:50,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:16:50,107 INFO L87 Difference]: Start difference. First operand 90 states and 143 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:16:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:16:50,365 INFO L93 Difference]: Finished difference Result 269 states and 428 transitions. [2025-03-17 01:16:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:16:50,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-17 01:16:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:16:50,368 INFO L225 Difference]: With dead ends: 269 [2025-03-17 01:16:50,368 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 01:16:50,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:16:50,369 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 110 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:16:50,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 463 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:16:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 01:16:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 136. [2025-03-17 01:16:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 79 states have internal predecessors, (107), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 01:16:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 215 transitions. [2025-03-17 01:16:50,416 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 215 transitions. Word has length 170 [2025-03-17 01:16:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:16:50,417 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 215 transitions. [2025-03-17 01:16:50,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:16:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 215 transitions. [2025-03-17 01:16:50,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 01:16:50,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:16:50,422 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:16:50,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:16:50,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:16:50,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:16:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1502222473, now seen corresponding path program 1 times [2025-03-17 01:16:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:16:50,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748797651] [2025-03-17 01:16:50,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:16:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:16:50,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 01:16:50,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 01:16:50,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:16:50,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:17:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:17:01,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:17:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748797651] [2025-03-17 01:17:01,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748797651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:17:01,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:17:01,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:17:01,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648812115] [2025-03-17 01:17:01,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:17:01,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:17:01,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:17:01,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:17:01,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:17:01,648 INFO L87 Difference]: Start difference. First operand 136 states and 215 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:17:05,949 INFO L93 Difference]: Finished difference Result 421 states and 668 transitions. [2025-03-17 01:17:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:17:05,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-17 01:17:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:17:05,951 INFO L225 Difference]: With dead ends: 421 [2025-03-17 01:17:05,951 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 01:17:05,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:17:05,953 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 945 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:17:05,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 739 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 01:17:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 01:17:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 177. [2025-03-17 01:17:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 120 states have (on average 1.425) internal successors, (171), 120 states have internal predecessors, (171), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 01:17:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 279 transitions. [2025-03-17 01:17:05,977 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 279 transitions. Word has length 170 [2025-03-17 01:17:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:17:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 279 transitions. [2025-03-17 01:17:05,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 279 transitions. [2025-03-17 01:17:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 01:17:05,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:17:05,980 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:17:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:17:05,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:17:05,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:17:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1439435126, now seen corresponding path program 1 times [2025-03-17 01:17:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:17:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052097086] [2025-03-17 01:17:05,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:17:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:17:05,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 01:17:06,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 01:17:06,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:17:06,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:17:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:17:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:17:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052097086] [2025-03-17 01:17:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052097086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:17:06,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:17:06,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:17:06,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231863292] [2025-03-17 01:17:06,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:17:06,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:17:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:17:06,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:17:06,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:17:06,045 INFO L87 Difference]: Start difference. First operand 177 states and 279 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:17:06,101 INFO L93 Difference]: Finished difference Result 354 states and 561 transitions. [2025-03-17 01:17:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:17:06,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-17 01:17:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:17:06,104 INFO L225 Difference]: With dead ends: 354 [2025-03-17 01:17:06,104 INFO L226 Difference]: Without dead ends: 265 [2025-03-17 01:17:06,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:17:06,105 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 134 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:17:06,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 312 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:17:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-17 01:17:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2025-03-17 01:17:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 178 states have (on average 1.4213483146067416) internal successors, (253), 178 states have internal predecessors, (253), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 01:17:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 415 transitions. [2025-03-17 01:17:06,132 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 415 transitions. Word has length 170 [2025-03-17 01:17:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:17:06,134 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 415 transitions. [2025-03-17 01:17:06,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 415 transitions. [2025-03-17 01:17:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 01:17:06,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:17:06,136 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:17:06,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:17:06,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:17:06,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:17:06,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1262781812, now seen corresponding path program 1 times [2025-03-17 01:17:06,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:17:06,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539409385] [2025-03-17 01:17:06,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:17:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:17:06,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 01:17:06,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 01:17:06,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:17:06,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:17:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:17:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:17:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539409385] [2025-03-17 01:17:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539409385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:17:12,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:17:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:17:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351666993] [2025-03-17 01:17:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:17:12,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:17:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:17:12,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:17:12,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:17:12,442 INFO L87 Difference]: Start difference. First operand 263 states and 415 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:17:15,507 INFO L93 Difference]: Finished difference Result 608 states and 956 transitions. [2025-03-17 01:17:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 01:17:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 01:17:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:17:15,511 INFO L225 Difference]: With dead ends: 608 [2025-03-17 01:17:15,511 INFO L226 Difference]: Without dead ends: 407 [2025-03-17 01:17:15,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2025-03-17 01:17:15,516 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 685 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:17:15,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1055 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 01:17:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-17 01:17:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 265. [2025-03-17 01:17:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 180 states have (on average 1.4111111111111112) internal successors, (254), 180 states have internal predecessors, (254), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 01:17:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 416 transitions. [2025-03-17 01:17:15,541 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 416 transitions. Word has length 171 [2025-03-17 01:17:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:17:15,542 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 416 transitions. [2025-03-17 01:17:15,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 416 transitions. [2025-03-17 01:17:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 01:17:15,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:17:15,544 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:17:15,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:17:15,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:17:15,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:17:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1085334001, now seen corresponding path program 1 times [2025-03-17 01:17:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:17:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030009327] [2025-03-17 01:17:15,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:17:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:17:15,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 01:17:15,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 01:17:15,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:17:15,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:17:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:17:15,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:17:15,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030009327] [2025-03-17 01:17:15,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030009327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:17:15,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:17:15,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:17:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546314371] [2025-03-17 01:17:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:17:15,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:17:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:17:15,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:17:15,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:17:15,807 INFO L87 Difference]: Start difference. First operand 265 states and 416 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 01:17:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:17:15,887 INFO L93 Difference]: Finished difference Result 502 states and 794 transitions. [2025-03-17 01:17:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:17:15,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2025-03-17 01:17:15,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:17:15,891 INFO L225 Difference]: With dead ends: 502 [2025-03-17 01:17:15,891 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 01:17:15,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:17:15,892 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 193 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:17:15,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 362 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:17:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 01:17:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2025-03-17 01:17:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 180 states have (on average 1.3944444444444444) internal successors, (251), 180 states have internal predecessors, (251), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 01:17:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 413 transitions. [2025-03-17 01:17:15,906 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 413 transitions. Word has length 171 [2025-03-17 01:17:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:17:15,906 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 413 transitions. [2025-03-17 01:17:15,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 01:17:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 413 transitions. [2025-03-17 01:17:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 01:17:15,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:17:15,908 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:17:15,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:17:15,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:17:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:17:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash 791930994, now seen corresponding path program 1 times [2025-03-17 01:17:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:17:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887902350] [2025-03-17 01:17:15,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:17:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:17:15,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 01:17:15,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 01:17:15,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:17:15,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:17:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:17:26,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:17:26,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887902350] [2025-03-17 01:17:26,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887902350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:17:26,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:17:26,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 01:17:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492384376] [2025-03-17 01:17:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:17:26,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:17:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:17:26,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:17:26,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:17:26,753 INFO L87 Difference]: Start difference. First operand 265 states and 413 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:17:29,596 INFO L93 Difference]: Finished difference Result 409 states and 629 transitions. [2025-03-17 01:17:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:17:29,596 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 01:17:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:17:29,600 INFO L225 Difference]: With dead ends: 409 [2025-03-17 01:17:29,600 INFO L226 Difference]: Without dead ends: 407 [2025-03-17 01:17:29,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:17:29,601 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 947 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:17:29,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 851 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 01:17:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-17 01:17:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 265. [2025-03-17 01:17:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 180 states have (on average 1.3944444444444444) internal successors, (251), 180 states have internal predecessors, (251), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 01:17:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 413 transitions. [2025-03-17 01:17:29,617 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 413 transitions. Word has length 171 [2025-03-17 01:17:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:17:29,618 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 413 transitions. [2025-03-17 01:17:29,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 413 transitions. [2025-03-17 01:17:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 01:17:29,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:17:29,619 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:17:29,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:17:29,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:17:29,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:17:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash -893223471, now seen corresponding path program 1 times [2025-03-17 01:17:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:17:29,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826069895] [2025-03-17 01:17:29,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:17:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:17:29,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 01:17:29,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 01:17:29,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:17:29,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:17:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:17:29,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:17:29,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826069895] [2025-03-17 01:17:29,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826069895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:17:29,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:17:29,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:17:29,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212127311] [2025-03-17 01:17:29,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:17:29,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:17:29,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:17:29,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:17:29,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:17:29,735 INFO L87 Difference]: Start difference. First operand 265 states and 413 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:17:29,773 INFO L93 Difference]: Finished difference Result 530 states and 829 transitions. [2025-03-17 01:17:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:17:29,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 01:17:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:17:29,776 INFO L225 Difference]: With dead ends: 530 [2025-03-17 01:17:29,776 INFO L226 Difference]: Without dead ends: 355 [2025-03-17 01:17:29,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 01:17:29,777 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 84 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:17:29,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 313 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:17:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-17 01:17:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2025-03-17 01:17:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 240 states have (on average 1.3958333333333333) internal successors, (335), 240 states have internal predecessors, (335), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 01:17:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 551 transitions. [2025-03-17 01:17:29,800 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 551 transitions. Word has length 171 [2025-03-17 01:17:29,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:17:29,800 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 551 transitions. [2025-03-17 01:17:29,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:29,801 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 551 transitions. [2025-03-17 01:17:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 01:17:29,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:17:29,802 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:17:29,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:17:29,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:17:29,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:17:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1089736976, now seen corresponding path program 1 times [2025-03-17 01:17:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:17:29,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259209064] [2025-03-17 01:17:29,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:17:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:17:29,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 01:17:29,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 01:17:29,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:17:29,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:17:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:17:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:17:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259209064] [2025-03-17 01:17:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259209064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:17:36,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:17:36,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:17:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365971819] [2025-03-17 01:17:36,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:17:36,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:17:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:17:36,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:17:36,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:17:36,657 INFO L87 Difference]: Start difference. First operand 353 states and 551 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:17:44,348 INFO L93 Difference]: Finished difference Result 529 states and 814 transitions. [2025-03-17 01:17:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 01:17:44,349 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 01:17:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:17:44,352 INFO L225 Difference]: With dead ends: 529 [2025-03-17 01:17:44,352 INFO L226 Difference]: Without dead ends: 527 [2025-03-17 01:17:44,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=274, Invalid=718, Unknown=0, NotChecked=0, Total=992 [2025-03-17 01:17:44,353 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 834 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:17:44,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 929 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-17 01:17:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-17 01:17:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 387. [2025-03-17 01:17:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 274 states have (on average 1.416058394160584) internal successors, (388), 274 states have internal predecessors, (388), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 01:17:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 604 transitions. [2025-03-17 01:17:44,387 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 604 transitions. Word has length 171 [2025-03-17 01:17:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:17:44,388 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 604 transitions. [2025-03-17 01:17:44,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 604 transitions. [2025-03-17 01:17:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 01:17:44,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:17:44,390 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:17:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:17:44,391 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:17:44,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:17:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash 718582443, now seen corresponding path program 1 times [2025-03-17 01:17:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:17:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770156783] [2025-03-17 01:17:44,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:17:44,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:17:44,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 01:17:44,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 01:17:44,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:17:44,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:17:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:17:47,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:17:47,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770156783] [2025-03-17 01:17:47,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770156783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:17:47,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:17:47,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:17:47,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088894889] [2025-03-17 01:17:47,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:17:47,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:17:47,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:17:47,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:17:47,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:17:47,809 INFO L87 Difference]: Start difference. First operand 387 states and 604 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:17:49,094 INFO L93 Difference]: Finished difference Result 553 states and 854 transitions. [2025-03-17 01:17:49,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 01:17:49,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 01:17:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:17:49,097 INFO L225 Difference]: With dead ends: 553 [2025-03-17 01:17:49,097 INFO L226 Difference]: Without dead ends: 551 [2025-03-17 01:17:49,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 01:17:49,098 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 661 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:17:49,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1280 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:17:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-17 01:17:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 383. [2025-03-17 01:17:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 270 states have (on average 1.4185185185185185) internal successors, (383), 270 states have internal predecessors, (383), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 01:17:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 599 transitions. [2025-03-17 01:17:49,126 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 599 transitions. Word has length 172 [2025-03-17 01:17:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:17:49,127 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 599 transitions. [2025-03-17 01:17:49,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:17:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 599 transitions. [2025-03-17 01:17:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 01:17:49,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:17:49,129 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:17:49,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:17:49,129 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:17:49,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:17:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1975063284, now seen corresponding path program 1 times [2025-03-17 01:17:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:17:49,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51525085] [2025-03-17 01:17:49,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:17:49,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:17:49,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 01:17:49,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 01:17:49,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:17:49,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:18:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:18:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:18:05,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51525085] [2025-03-17 01:18:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51525085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:18:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:18:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:18:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883625964] [2025-03-17 01:18:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:18:05,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:18:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:18:05,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:18:05,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:18:05,577 INFO L87 Difference]: Start difference. First operand 383 states and 599 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)