./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.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-pr-ci_file-52.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 b4834357d23aac5c2a51d001b1c25f4722c265308db77262bd19157b1e0789ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:23:57,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:23:57,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:23:57,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:23:57,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:23:57,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:23:57,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:23:57,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:23:57,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:23:57,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:23:57,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:23:57,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:23:57,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:23:57,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:23:57,843 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:23:57,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:23:57,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:23:57,843 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:23:57,844 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:23:57,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:23:57,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:23:57,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:57,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:23:57,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:23:57,845 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:23:57,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:23:57,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:23:57,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:23:57,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:23:57,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:23:57,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:23:57,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:23:57,846 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 -> b4834357d23aac5c2a51d001b1c25f4722c265308db77262bd19157b1e0789ed [2025-03-17 01:23:58,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:23:58,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:23:58,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:23:58,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:23:58,098 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:23:58,100 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-pr-ci_file-52.i [2025-03-17 01:23:59,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/904e6a72a/c3d1b9ef138041cf82955b80366d6e0a/FLAG41a172b2c [2025-03-17 01:23:59,480 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:23:59,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2025-03-17 01:23:59,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/904e6a72a/c3d1b9ef138041cf82955b80366d6e0a/FLAG41a172b2c [2025-03-17 01:23:59,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/904e6a72a/c3d1b9ef138041cf82955b80366d6e0a [2025-03-17 01:23:59,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:23:59,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:23:59,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:23:59,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:23:59,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:23:59,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:59" (1/1) ... [2025-03-17 01:23:59,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c55c6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:59, skipping insertion in model container [2025-03-17 01:23:59,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:59" (1/1) ... [2025-03-17 01:23:59,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:23:59,942 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-pr-ci_file-52.i[919,932] [2025-03-17 01:24:00,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:24:00,014 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:24:00,023 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-pr-ci_file-52.i[919,932] [2025-03-17 01:24:00,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:24:00,059 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:24:00,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00 WrapperNode [2025-03-17 01:24:00,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:24:00,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:24:00,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:24:00,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:24:00,065 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:24:00" (1/1) ... [2025-03-17 01:24:00,076 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:24:00" (1/1) ... [2025-03-17 01:24:00,110 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-03-17 01:24:00,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:24:00,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:24:00,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:24:00,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:24:00,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,132 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:24:00,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:24:00,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:24:00,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:24:00,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:24:00,152 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:24:00,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:24:00,175 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:24:00,181 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:24:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:24:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:24:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:24:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:24:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:24:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:24:00,260 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:24:00,261 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:24:00,588 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 01:24:00,588 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:24:00,609 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:24:00,610 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:24:00,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:24:00 BoogieIcfgContainer [2025-03-17 01:24:00,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:24:00,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:24:00,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:24:00,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:24:00,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:23:59" (1/3) ... [2025-03-17 01:24:00,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddf4e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:24:00, skipping insertion in model container [2025-03-17 01:24:00,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (2/3) ... [2025-03-17 01:24:00,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddf4e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:24:00, skipping insertion in model container [2025-03-17 01:24:00,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:24:00" (3/3) ... [2025-03-17 01:24:00,617 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2025-03-17 01:24:00,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:24:00,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:24:00,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:24:00,682 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;@60f96ff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:24:00,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:24:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 53 states have (on average 1.528301886792453) internal successors, (81), 54 states have internal predecessors, (81), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 01:24:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 01:24:00,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:00,695 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:00,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:00,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1029978033, now seen corresponding path program 1 times [2025-03-17 01:24:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:00,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542273402] [2025-03-17 01:24:00,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:00,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 01:24:00,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 01:24:00,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:00,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 01:24:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:00,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542273402] [2025-03-17 01:24:00,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542273402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:24:00,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687735268] [2025-03-17 01:24:00,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:00,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:24:00,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:24:00,952 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:24:00,954 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:24:01,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 01:24:01,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 01:24:01,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:01,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:01,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:24:01,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:24:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 01:24:01,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:24:01,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687735268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:01,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:24:01,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:24:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166012483] [2025-03-17 01:24:01,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:01,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:24:01,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:01,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:24:01,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:24:01,114 INFO L87 Difference]: Start difference. First operand has 73 states, 53 states have (on average 1.528301886792453) internal successors, (81), 54 states have internal predecessors, (81), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 01:24:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:01,145 INFO L93 Difference]: Finished difference Result 143 states and 245 transitions. [2025-03-17 01:24:01,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:24:01,147 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 120 [2025-03-17 01:24:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:01,152 INFO L225 Difference]: With dead ends: 143 [2025-03-17 01:24:01,152 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 01:24:01,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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:24:01,156 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:01,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:24:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 01:24:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 01:24:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 52 states have internal predecessors, (77), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 01:24:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2025-03-17 01:24:01,184 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 120 [2025-03-17 01:24:01,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:01,184 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2025-03-17 01:24:01,184 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 01:24:01,184 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2025-03-17 01:24:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 01:24:01,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:01,188 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:01,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:24:01,389 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:24:01,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:01,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash -572010412, now seen corresponding path program 1 times [2025-03-17 01:24:01,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:01,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494779979] [2025-03-17 01:24:01,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:01,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 01:24:01,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 01:24:01,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:01,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:01,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494779979] [2025-03-17 01:24:01,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494779979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:01,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:01,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:24:01,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899675300] [2025-03-17 01:24:01,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:01,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:24:01,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:01,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:24:01,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:24:01,690 INFO L87 Difference]: Start difference. First operand 71 states and 111 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:01,791 INFO L93 Difference]: Finished difference Result 173 states and 273 transitions. [2025-03-17 01:24:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:24:01,792 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 120 [2025-03-17 01:24:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:01,793 INFO L225 Difference]: With dead ends: 173 [2025-03-17 01:24:01,793 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 01:24:01,794 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:24:01,794 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 37 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:01,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 170 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:24:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 01:24:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2025-03-17 01:24:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.547945205479452) internal successors, (113), 73 states have internal predecessors, (113), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 01:24:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 147 transitions. [2025-03-17 01:24:01,805 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 147 transitions. Word has length 120 [2025-03-17 01:24:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:01,806 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 147 transitions. [2025-03-17 01:24:01,806 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 147 transitions. [2025-03-17 01:24:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 01:24:01,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:01,807 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:01,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:24:01,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:01,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1982626995, now seen corresponding path program 1 times [2025-03-17 01:24:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961758104] [2025-03-17 01:24:01,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:01,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 01:24:01,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 01:24:01,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:01,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:02,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961758104] [2025-03-17 01:24:02,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961758104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:02,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:02,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:24:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587891423] [2025-03-17 01:24:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:02,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:24:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:02,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:24:02,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:24:02,035 INFO L87 Difference]: Start difference. First operand 92 states and 147 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:02,109 INFO L93 Difference]: Finished difference Result 253 states and 403 transitions. [2025-03-17 01:24:02,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:24:02,110 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 121 [2025-03-17 01:24:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:02,112 INFO L225 Difference]: With dead ends: 253 [2025-03-17 01:24:02,113 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 01:24:02,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:24:02,114 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 104 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:02,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 265 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:24:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 01:24:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2025-03-17 01:24:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.5825242718446602) internal successors, (163), 103 states have internal predecessors, (163), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 01:24:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 197 transitions. [2025-03-17 01:24:02,133 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 197 transitions. Word has length 121 [2025-03-17 01:24:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:02,134 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 197 transitions. [2025-03-17 01:24:02,134 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 197 transitions. [2025-03-17 01:24:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 01:24:02,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:02,137 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:02,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:24:02,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:02,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash -481829324, now seen corresponding path program 1 times [2025-03-17 01:24:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218815359] [2025-03-17 01:24:02,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:02,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 01:24:02,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 01:24:02,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:02,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218815359] [2025-03-17 01:24:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218815359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:02,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:24:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100247887] [2025-03-17 01:24:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:02,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:24:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:02,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:24:02,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:24:02,396 INFO L87 Difference]: Start difference. First operand 122 states and 197 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:02,542 INFO L93 Difference]: Finished difference Result 262 states and 417 transitions. [2025-03-17 01:24:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:24:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 121 [2025-03-17 01:24:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:02,545 INFO L225 Difference]: With dead ends: 262 [2025-03-17 01:24:02,545 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 01:24:02,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:24:02,549 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 54 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:02,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 321 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:24:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 01:24:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2025-03-17 01:24:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.543859649122807) internal successors, (176), 115 states have internal predecessors, (176), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 01:24:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2025-03-17 01:24:02,566 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 218 transitions. Word has length 121 [2025-03-17 01:24:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:02,566 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 218 transitions. [2025-03-17 01:24:02,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 218 transitions. [2025-03-17 01:24:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 01:24:02,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:02,570 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:02,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:24:02,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:02,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -481799533, now seen corresponding path program 1 times [2025-03-17 01:24:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:02,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475745278] [2025-03-17 01:24:02,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:02,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 01:24:02,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 01:24:02,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:02,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475745278] [2025-03-17 01:24:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475745278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:02,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:24:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006195390] [2025-03-17 01:24:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:02,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:24:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:02,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:24:02,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:24:02,873 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:03,161 INFO L93 Difference]: Finished difference Result 364 states and 564 transitions. [2025-03-17 01:24:03,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:24:03,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 121 [2025-03-17 01:24:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:03,163 INFO L225 Difference]: With dead ends: 364 [2025-03-17 01:24:03,163 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 01:24:03,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:24:03,164 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 166 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:03,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 581 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:24:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 01:24:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 178. [2025-03-17 01:24:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 140 states have (on average 1.5071428571428571) internal successors, (211), 141 states have internal predecessors, (211), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 01:24:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 279 transitions. [2025-03-17 01:24:03,189 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 279 transitions. Word has length 121 [2025-03-17 01:24:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:03,189 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 279 transitions. [2025-03-17 01:24:03,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 279 transitions. [2025-03-17 01:24:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 01:24:03,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:03,191 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:03,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:24:03,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:03,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1025752276, now seen corresponding path program 1 times [2025-03-17 01:24:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:03,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223185552] [2025-03-17 01:24:03,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:03,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 01:24:03,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 01:24:03,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:03,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:03,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223185552] [2025-03-17 01:24:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223185552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:03,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:03,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:24:03,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020960323] [2025-03-17 01:24:03,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:03,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:24:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:03,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:24:03,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:24:03,379 INFO L87 Difference]: Start difference. First operand 178 states and 279 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:03,605 INFO L93 Difference]: Finished difference Result 363 states and 566 transitions. [2025-03-17 01:24:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:24:03,605 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 121 [2025-03-17 01:24:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:03,607 INFO L225 Difference]: With dead ends: 363 [2025-03-17 01:24:03,607 INFO L226 Difference]: Without dead ends: 186 [2025-03-17 01:24:03,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:24:03,608 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 175 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:03,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 474 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:24:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-17 01:24:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2025-03-17 01:24:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 140 states have (on average 1.5) internal successors, (210), 141 states have internal predecessors, (210), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 01:24:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 278 transitions. [2025-03-17 01:24:03,630 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 278 transitions. Word has length 121 [2025-03-17 01:24:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:03,630 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 278 transitions. [2025-03-17 01:24:03,632 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 278 transitions. [2025-03-17 01:24:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 01:24:03,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:03,633 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:03,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:24:03,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2022769908, now seen corresponding path program 1 times [2025-03-17 01:24:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205748888] [2025-03-17 01:24:03,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:03,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:03,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 01:24:03,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 01:24:03,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:03,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205748888] [2025-03-17 01:24:04,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205748888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:04,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:04,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:24:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918868151] [2025-03-17 01:24:04,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:04,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:24:04,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:04,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:24:04,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:24:04,223 INFO L87 Difference]: Start difference. First operand 178 states and 278 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:04,438 INFO L93 Difference]: Finished difference Result 567 states and 884 transitions. [2025-03-17 01:24:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:24:04,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 121 [2025-03-17 01:24:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:04,442 INFO L225 Difference]: With dead ends: 567 [2025-03-17 01:24:04,443 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 01:24:04,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:24:04,445 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 150 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:04,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 293 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:24:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 01:24:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 353. [2025-03-17 01:24:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 278 states have (on average 1.4892086330935252) internal successors, (414), 280 states have internal predecessors, (414), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 01:24:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 550 transitions. [2025-03-17 01:24:04,483 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 550 transitions. Word has length 121 [2025-03-17 01:24:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:04,484 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 550 transitions. [2025-03-17 01:24:04,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 550 transitions. [2025-03-17 01:24:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 01:24:04,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:04,486 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:04,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:24:04,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:04,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1571459451, now seen corresponding path program 1 times [2025-03-17 01:24:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:04,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618193292] [2025-03-17 01:24:04,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:04,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 01:24:04,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 01:24:04,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:04,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:10,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:10,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618193292] [2025-03-17 01:24:10,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618193292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:10,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:10,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:24:10,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589694489] [2025-03-17 01:24:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:10,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:24:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:10,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:24:10,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:24:10,434 INFO L87 Difference]: Start difference. First operand 353 states and 550 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 01:24:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:12,302 INFO L93 Difference]: Finished difference Result 985 states and 1520 transitions. [2025-03-17 01:24:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:24:12,303 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 123 [2025-03-17 01:24:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:12,306 INFO L225 Difference]: With dead ends: 985 [2025-03-17 01:24:12,306 INFO L226 Difference]: Without dead ends: 633 [2025-03-17 01:24:12,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-17 01:24:12,308 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 546 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:12,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 521 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:24:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-17 01:24:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 416. [2025-03-17 01:24:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 323 states have (on average 1.4613003095975232) internal successors, (472), 325 states have internal predecessors, (472), 85 states have call successors, (85), 7 states have call predecessors, (85), 7 states have return successors, (85), 83 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-17 01:24:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 642 transitions. [2025-03-17 01:24:12,347 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 642 transitions. Word has length 123 [2025-03-17 01:24:12,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:12,347 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 642 transitions. [2025-03-17 01:24:12,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 01:24:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 642 transitions. [2025-03-17 01:24:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 01:24:12,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:12,349 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:12,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:24:12,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:12,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash -63907642, now seen corresponding path program 1 times [2025-03-17 01:24:12,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:12,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659881063] [2025-03-17 01:24:12,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:12,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 01:24:12,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 01:24:12,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:12,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:12,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659881063] [2025-03-17 01:24:12,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659881063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:12,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:12,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:24:12,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134804082] [2025-03-17 01:24:12,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:12,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:24:12,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:12,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:24:12,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:24:12,494 INFO L87 Difference]: Start difference. First operand 416 states and 642 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:12,791 INFO L93 Difference]: Finished difference Result 922 states and 1417 transitions. [2025-03-17 01:24:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:24:12,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 123 [2025-03-17 01:24:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:12,795 INFO L225 Difference]: With dead ends: 922 [2025-03-17 01:24:12,796 INFO L226 Difference]: Without dead ends: 570 [2025-03-17 01:24:12,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:24:12,798 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 192 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:12,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 540 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:24:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-17 01:24:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 434. [2025-03-17 01:24:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 341 states have (on average 1.4780058651026393) internal successors, (504), 343 states have internal predecessors, (504), 85 states have call successors, (85), 7 states have call predecessors, (85), 7 states have return successors, (85), 83 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-17 01:24:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 674 transitions. [2025-03-17 01:24:12,832 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 674 transitions. Word has length 123 [2025-03-17 01:24:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:12,833 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 674 transitions. [2025-03-17 01:24:12,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 674 transitions. [2025-03-17 01:24:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 01:24:12,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:12,834 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:12,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:24:12,834 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:12,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:12,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1250869251, now seen corresponding path program 1 times [2025-03-17 01:24:12,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713085182] [2025-03-17 01:24:12,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:12,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:12,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 01:24:12,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 01:24:12,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:12,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:12,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:12,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713085182] [2025-03-17 01:24:12,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713085182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:12,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:12,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:24:12,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820806003] [2025-03-17 01:24:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:12,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:24:12,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:12,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:24:12,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:24:12,915 INFO L87 Difference]: Start difference. First operand 434 states and 674 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:13,031 INFO L93 Difference]: Finished difference Result 630 states and 973 transitions. [2025-03-17 01:24:13,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:24:13,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 123 [2025-03-17 01:24:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:13,034 INFO L225 Difference]: With dead ends: 630 [2025-03-17 01:24:13,034 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 01:24:13,037 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:24:13,037 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 133 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:13,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 138 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:24:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 01:24:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-03-17 01:24:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 203 states have (on average 1.4137931034482758) internal successors, (287), 203 states have internal predecessors, (287), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:24:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2025-03-17 01:24:13,064 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 123 [2025-03-17 01:24:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:13,065 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2025-03-17 01:24:13,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2025-03-17 01:24:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 01:24:13,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:13,067 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:13,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:24:13,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash 960471892, now seen corresponding path program 1 times [2025-03-17 01:24:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097826526] [2025-03-17 01:24:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:13,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 01:24:13,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 01:24:13,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:13,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:15,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:15,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097826526] [2025-03-17 01:24:15,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097826526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:15,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:15,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:24:15,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301798247] [2025-03-17 01:24:15,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:15,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:24:15,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:15,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:24:15,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:24:15,118 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 01:24:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:15,903 INFO L93 Difference]: Finished difference Result 537 states and 800 transitions. [2025-03-17 01:24:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 01:24:15,903 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 124 [2025-03-17 01:24:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:15,905 INFO L225 Difference]: With dead ends: 537 [2025-03-17 01:24:15,905 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 01:24:15,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-17 01:24:15,906 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 361 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:15,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 493 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:24:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 01:24:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2025-03-17 01:24:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 208 states have (on average 1.4134615384615385) internal successors, (294), 208 states have internal predecessors, (294), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:24:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 396 transitions. [2025-03-17 01:24:15,928 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 396 transitions. Word has length 124 [2025-03-17 01:24:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:15,929 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 396 transitions. [2025-03-17 01:24:15,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 01:24:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 396 transitions. [2025-03-17 01:24:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 01:24:15,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:15,930 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:15,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:24:15,930 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:15,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash 353179238, now seen corresponding path program 1 times [2025-03-17 01:24:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961926396] [2025-03-17 01:24:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:15,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 01:24:15,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 01:24:15,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:15,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:16,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:16,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961926396] [2025-03-17 01:24:16,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961926396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:16,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:16,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:24:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470446560] [2025-03-17 01:24:16,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:16,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:24:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:16,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:24:16,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:24:16,079 INFO L87 Difference]: Start difference. First operand 265 states and 396 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:16,290 INFO L93 Difference]: Finished difference Result 514 states and 764 transitions. [2025-03-17 01:24:16,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 01:24:16,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2025-03-17 01:24:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:16,293 INFO L225 Difference]: With dead ends: 514 [2025-03-17 01:24:16,293 INFO L226 Difference]: Without dead ends: 318 [2025-03-17 01:24:16,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:24:16,294 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 254 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:16,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 364 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:24:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-17 01:24:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 286. [2025-03-17 01:24:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 229 states have (on average 1.4148471615720524) internal successors, (324), 229 states have internal predecessors, (324), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:24:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 426 transitions. [2025-03-17 01:24:16,312 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 426 transitions. Word has length 125 [2025-03-17 01:24:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:16,312 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 426 transitions. [2025-03-17 01:24:16,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 426 transitions. [2025-03-17 01:24:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 01:24:16,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:16,313 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:24:16,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:16,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:16,314 INFO L85 PathProgramCache]: Analyzing trace with hash 353209029, now seen corresponding path program 1 times [2025-03-17 01:24:16,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:16,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754507314] [2025-03-17 01:24:16,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:16,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:16,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 01:24:16,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 01:24:16,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:16,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:20,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:20,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754507314] [2025-03-17 01:24:20,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754507314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:20,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:20,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:24:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715239162] [2025-03-17 01:24:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:20,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:24:20,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:20,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:24:20,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:24:20,707 INFO L87 Difference]: Start difference. First operand 286 states and 426 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 01:24:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:23,706 INFO L93 Difference]: Finished difference Result 392 states and 555 transitions. [2025-03-17 01:24:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 01:24:23,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 125 [2025-03-17 01:24:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:23,709 INFO L225 Difference]: With dead ends: 392 [2025-03-17 01:24:23,709 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 01:24:23,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2025-03-17 01:24:23,710 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 494 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:23,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 411 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:24:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 01:24:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 318. [2025-03-17 01:24:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 261 states have (on average 1.3946360153256705) internal successors, (364), 261 states have internal predecessors, (364), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:24:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 466 transitions. [2025-03-17 01:24:23,731 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 466 transitions. Word has length 125 [2025-03-17 01:24:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:23,731 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 466 transitions. [2025-03-17 01:24:23,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 01:24:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 466 transitions. [2025-03-17 01:24:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:24:23,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:23,734 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:23,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:24:23,735 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:23,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1454030858, now seen corresponding path program 1 times [2025-03-17 01:24:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612954061] [2025-03-17 01:24:23,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:23,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:24:23,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:24:23,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:23,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:25,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612954061] [2025-03-17 01:24:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612954061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 01:24:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660819019] [2025-03-17 01:24:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:25,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:24:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:25,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:24:25,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:24:25,624 INFO L87 Difference]: Start difference. First operand 318 states and 466 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:26,558 INFO L93 Difference]: Finished difference Result 559 states and 805 transitions. [2025-03-17 01:24:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:24:26,559 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-17 01:24:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:26,561 INFO L225 Difference]: With dead ends: 559 [2025-03-17 01:24:26,561 INFO L226 Difference]: Without dead ends: 443 [2025-03-17 01:24:26,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2025-03-17 01:24:26,562 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 308 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:26,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 239 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:24:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-17 01:24:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 318. [2025-03-17 01:24:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 261 states have (on average 1.3908045977011494) internal successors, (363), 261 states have internal predecessors, (363), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:24:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 465 transitions. [2025-03-17 01:24:26,583 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 465 transitions. Word has length 126 [2025-03-17 01:24:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:26,583 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 465 transitions. [2025-03-17 01:24:26,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 465 transitions. [2025-03-17 01:24:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:24:26,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:26,584 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:26,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 01:24:26,585 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:26,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2120512708, now seen corresponding path program 1 times [2025-03-17 01:24:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:26,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73075480] [2025-03-17 01:24:26,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:26,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:24:26,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:24:26,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:26,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:28,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:28,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73075480] [2025-03-17 01:24:28,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73075480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:28,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:28,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:24:28,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070527661] [2025-03-17 01:24:28,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:28,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:24:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:28,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:24:28,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:24:28,609 INFO L87 Difference]: Start difference. First operand 318 states and 465 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 01:24:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:29,559 INFO L93 Difference]: Finished difference Result 740 states and 1079 transitions. [2025-03-17 01:24:29,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 01:24:29,560 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2025-03-17 01:24:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:29,563 INFO L225 Difference]: With dead ends: 740 [2025-03-17 01:24:29,563 INFO L226 Difference]: Without dead ends: 507 [2025-03-17 01:24:29,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=415, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:24:29,564 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 280 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:29,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 261 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:24:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-17 01:24:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 375. [2025-03-17 01:24:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 318 states have (on average 1.3836477987421383) internal successors, (440), 318 states have internal predecessors, (440), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:24:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 542 transitions. [2025-03-17 01:24:29,586 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 542 transitions. Word has length 126 [2025-03-17 01:24:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:29,586 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 542 transitions. [2025-03-17 01:24:29,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 01:24:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 542 transitions. [2025-03-17 01:24:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:24:29,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:29,587 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:29,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:24:29,587 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:29,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:29,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1661264133, now seen corresponding path program 1 times [2025-03-17 01:24:29,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:29,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880982464] [2025-03-17 01:24:29,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:29,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:29,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:24:29,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:24:29,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:29,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 01:24:31,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880982464] [2025-03-17 01:24:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880982464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:31,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:24:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507668330] [2025-03-17 01:24:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:24:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:31,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:24:31,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:24:31,182 INFO L87 Difference]: Start difference. First operand 375 states and 542 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 01:24:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:31,699 INFO L93 Difference]: Finished difference Result 714 states and 1023 transitions. [2025-03-17 01:24:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:24:31,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2025-03-17 01:24:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:31,702 INFO L225 Difference]: With dead ends: 714 [2025-03-17 01:24:31,702 INFO L226 Difference]: Without dead ends: 397 [2025-03-17 01:24:31,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:24:31,703 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 111 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:31,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 357 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:24:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-17 01:24:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 361. [2025-03-17 01:24:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 304 states have (on average 1.381578947368421) internal successors, (420), 304 states have internal predecessors, (420), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:24:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 522 transitions. [2025-03-17 01:24:31,722 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 522 transitions. Word has length 126 [2025-03-17 01:24:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:31,723 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 522 transitions. [2025-03-17 01:24:31,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 01:24:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 522 transitions. [2025-03-17 01:24:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-17 01:24:31,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:31,724 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:24:31,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 01:24:31,725 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:31,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1121409417, now seen corresponding path program 1 times [2025-03-17 01:24:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907469959] [2025-03-17 01:24:31,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:31,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-17 01:24:31,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-17 01:24:31,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:31,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2294 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:24:32,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:32,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907469959] [2025-03-17 01:24:32,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907469959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:32,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:32,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:24:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672421493] [2025-03-17 01:24:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:32,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:24:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:32,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:24:32,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:24:32,286 INFO L87 Difference]: Start difference. First operand 361 states and 522 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:24:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:32,467 INFO L93 Difference]: Finished difference Result 569 states and 816 transitions. [2025-03-17 01:24:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:24:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 246 [2025-03-17 01:24:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:32,469 INFO L225 Difference]: With dead ends: 569 [2025-03-17 01:24:32,469 INFO L226 Difference]: Without dead ends: 413 [2025-03-17 01:24:32,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:24:32,470 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 162 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:32,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 245 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:24:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-17 01:24:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2025-03-17 01:24:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 350 states have (on average 1.3771428571428572) internal successors, (482), 351 states have internal predecessors, (482), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 01:24:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 588 transitions. [2025-03-17 01:24:32,493 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 588 transitions. Word has length 246 [2025-03-17 01:24:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:32,494 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 588 transitions. [2025-03-17 01:24:32,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:24:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 588 transitions. [2025-03-17 01:24:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-17 01:24:32,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:32,496 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:24:32,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 01:24:32,496 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:32,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 559199953, now seen corresponding path program 1 times [2025-03-17 01:24:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067496357] [2025-03-17 01:24:32,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:32,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 01:24:32,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 01:24:32,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:32,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:24:44,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:24:44,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067496357] [2025-03-17 01:24:44,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067496357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:24:44,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427031229] [2025-03-17 01:24:44,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:44,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:24:44,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:24:44,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:24:44,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:24:44,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 01:24:44,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 01:24:44,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:44,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:44,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:24:44,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:24:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2274 trivial. 0 not checked. [2025-03-17 01:24:44,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:24:44,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427031229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:44,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:24:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2025-03-17 01:24:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578610362] [2025-03-17 01:24:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:44,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:24:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:24:44,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:24:44,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-17 01:24:44,634 INFO L87 Difference]: Start difference. First operand 410 states and 588 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:44,724 INFO L93 Difference]: Finished difference Result 606 states and 850 transitions. [2025-03-17 01:24:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:24:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 247 [2025-03-17 01:24:44,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:44,728 INFO L225 Difference]: With dead ends: 606 [2025-03-17 01:24:44,728 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 01:24:44,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-17 01:24:44,730 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 89 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:24:44,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 240 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:24:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 01:24:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-17 01:24:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 194 states have (on average 1.2268041237113403) internal successors, (238), 195 states have internal predecessors, (238), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 01:24:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 344 transitions. [2025-03-17 01:24:44,751 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 344 transitions. Word has length 247 [2025-03-17 01:24:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:44,752 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 344 transitions. [2025-03-17 01:24:44,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 01:24:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 344 transitions. [2025-03-17 01:24:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 01:24:44,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:44,754 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:24:44,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 01:24:44,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 01:24:44,955 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:44,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash -782503919, now seen corresponding path program 1 times [2025-03-17 01:24:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:24:44,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978353233] [2025-03-17 01:24:44,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:24:44,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 01:24:45,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 01:24:45,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:45,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:25:00,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:25:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978353233] [2025-03-17 01:25:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978353233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:25:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294412398] [2025-03-17 01:25:00,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:00,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:25:00,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:25:00,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:25:00,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 01:25:00,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 01:25:00,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 01:25:00,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:00,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:00,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:25:00,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:25:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 772 proven. 18 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2025-03-17 01:25:00,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:25:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 118 proven. 18 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2025-03-17 01:25:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294412398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:25:00,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:25:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5, 5] total 24 [2025-03-17 01:25:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473013527] [2025-03-17 01:25:00,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:25:00,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 01:25:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:25:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 01:25:00,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:25:00,736 INFO L87 Difference]: Start difference. First operand 254 states and 344 transitions. Second operand has 24 states, 24 states have (on average 7.0) internal successors, (168), 24 states have internal predecessors, (168), 5 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2025-03-17 01:25:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:25:05,331 INFO L93 Difference]: Finished difference Result 569 states and 739 transitions. [2025-03-17 01:25:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 01:25:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.0) internal successors, (168), 24 states have internal predecessors, (168), 5 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) Word has length 249 [2025-03-17 01:25:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:25:05,334 INFO L225 Difference]: With dead ends: 569 [2025-03-17 01:25:05,334 INFO L226 Difference]: Without dead ends: 364 [2025-03-17 01:25:05,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 505 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 01:25:05,335 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 744 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:25:05,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 422 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 01:25:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-17 01:25:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 298. [2025-03-17 01:25:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 232 states have (on average 1.2155172413793103) internal successors, (282), 233 states have internal predecessors, (282), 53 states have call successors, (53), 12 states have call predecessors, (53), 12 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 01:25:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 388 transitions. [2025-03-17 01:25:05,366 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 388 transitions. Word has length 249 [2025-03-17 01:25:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:25:05,367 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 388 transitions. [2025-03-17 01:25:05,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.0) internal successors, (168), 24 states have internal predecessors, (168), 5 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2025-03-17 01:25:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 388 transitions. [2025-03-17 01:25:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-17 01:25:05,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:25:05,368 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:25:05,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 01:25:05,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:25:05,569 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:25:05,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:25:05,570 INFO L85 PathProgramCache]: Analyzing trace with hash 421621364, now seen corresponding path program 1 times [2025-03-17 01:25:05,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:25:05,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875660502] [2025-03-17 01:25:05,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:05,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:25:05,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-17 01:25:05,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-17 01:25:05,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:05,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 2263 trivial. 0 not checked. [2025-03-17 01:25:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:25:05,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875660502] [2025-03-17 01:25:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875660502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:25:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:25:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:25:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103100224] [2025-03-17 01:25:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:25:05,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:25:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:25:05,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:25:05,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:25:05,693 INFO L87 Difference]: Start difference. First operand 298 states and 388 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:25:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:25:05,801 INFO L93 Difference]: Finished difference Result 551 states and 709 transitions. [2025-03-17 01:25:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:25:05,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 253 [2025-03-17 01:25:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:25:05,804 INFO L225 Difference]: With dead ends: 551 [2025-03-17 01:25:05,804 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 01:25:05,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:25:05,805 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 121 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:25:05,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 173 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:25:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 01:25:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-03-17 01:25:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 241 states have (on average 1.1908713692946058) internal successors, (287), 242 states have internal predecessors, (287), 53 states have call successors, (53), 15 states have call predecessors, (53), 15 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 01:25:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 393 transitions. [2025-03-17 01:25:05,836 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 393 transitions. Word has length 253 [2025-03-17 01:25:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:25:05,837 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 393 transitions. [2025-03-17 01:25:05,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:25:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 393 transitions. [2025-03-17 01:25:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-17 01:25:05,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:25:05,838 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:25:05,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 01:25:05,838 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:25:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:25:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash -88912813, now seen corresponding path program 1 times [2025-03-17 01:25:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:25:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619807860] [2025-03-17 01:25:05,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:25:05,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-17 01:25:05,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-17 01:25:05,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:05,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:25:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:25:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619807860] [2025-03-17 01:25:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619807860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:25:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621115784] [2025-03-17 01:25:10,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:10,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:25:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:25:10,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:25:10,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 01:25:10,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-17 01:25:10,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-17 01:25:10,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:10,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:10,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 01:25:10,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:25:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 1520 proven. 51 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-03-17 01:25:10,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:25:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 50 proven. 195 refuted. 0 times theorem prover too weak. 2055 trivial. 0 not checked. [2025-03-17 01:25:11,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621115784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:25:11,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:25:11,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 33 [2025-03-17 01:25:11,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458893741] [2025-03-17 01:25:11,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:25:11,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 01:25:11,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:25:11,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 01:25:11,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 01:25:11,463 INFO L87 Difference]: Start difference. First operand 310 states and 393 transitions. Second operand has 33 states, 33 states have (on average 7.0) internal successors, (231), 33 states have internal predecessors, (231), 7 states have call successors, (88), 4 states have call predecessors, (88), 8 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) [2025-03-17 01:25:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:25:13,549 INFO L93 Difference]: Finished difference Result 583 states and 718 transitions. [2025-03-17 01:25:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 01:25:13,550 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.0) internal successors, (231), 33 states have internal predecessors, (231), 7 states have call successors, (88), 4 states have call predecessors, (88), 8 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) Word has length 253 [2025-03-17 01:25:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:25:13,551 INFO L225 Difference]: With dead ends: 583 [2025-03-17 01:25:13,551 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 01:25:13,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 490 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=812, Invalid=4158, Unknown=0, NotChecked=0, Total=4970 [2025-03-17 01:25:13,553 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 349 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:25:13,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 809 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:25:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 01:25:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 01:25:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 01:25:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 01:25:13,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2025-03-17 01:25:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:25:13,554 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 01:25:13,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.0) internal successors, (231), 33 states have internal predecessors, (231), 7 states have call successors, (88), 4 states have call predecessors, (88), 8 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) [2025-03-17 01:25:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 01:25:13,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 01:25:13,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:25:13,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 01:25:13,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:25:13,759 INFO L422 BasicCegarLoop]: Path program histogram: [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:25:13,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.