./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 11f663f31fd7e407dcb664c9f5df2c771bffa1ce1600c8629f9e6c1a07759991 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:45:48,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:45:48,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:45:48,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:45:48,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:45:48,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:45:48,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:45:48,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:45:48,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:45:48,159 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:45:48,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:45:48,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:45:48,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:45:48,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:45:48,160 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:45:48,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:45:48,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:45:48,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:45:48,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:45:48,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:45:48,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:45:48,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:45:48,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:45:48,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:45:48,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:45:48,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:45:48,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:45:48,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:45:48,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:45:48,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:45:48,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:45:48,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:45:48,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:45:48,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:45:48,165 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-jdk21/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 -> 11f663f31fd7e407dcb664c9f5df2c771bffa1ce1600c8629f9e6c1a07759991 [2025-02-05 21:45:48,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:45:48,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:45:48,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:45:48,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:45:48,479 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:45:48,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i [2025-02-05 21:45:49,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/986730b3f/459e4f682a9540338760817be8635be9/FLAG722328554 [2025-02-05 21:45:50,147 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:45:50,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i [2025-02-05 21:45:50,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/986730b3f/459e4f682a9540338760817be8635be9/FLAG722328554 [2025-02-05 21:45:50,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/986730b3f/459e4f682a9540338760817be8635be9 [2025-02-05 21:45:50,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:45:50,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:45:50,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:45:50,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:45:50,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:45:50,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d8d3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50, skipping insertion in model container [2025-02-05 21:45:50,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:45:50,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i[915,928] [2025-02-05 21:45:50,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:45:50,689 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:45:50,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i[915,928] [2025-02-05 21:45:50,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:45:50,752 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:45:50,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50 WrapperNode [2025-02-05 21:45:50,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:45:50,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:45:50,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:45:50,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:45:50,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,796 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2025-02-05 21:45:50,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:45:50,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:45:50,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:45:50,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:45:50,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,831 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-02-05 21:45:50,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:45:50,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:45:50,849 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:45:50,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:45:50,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (1/1) ... [2025-02-05 21:45:50,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:45:50,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:45:50,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:45:50,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:45:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:45:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:45:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:45:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:45:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:45:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:45:50,987 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:45:50,988 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:45:51,403 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc property_#t~bitwise21#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2025-02-05 21:45:51,437 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 21:45:51,438 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:45:51,457 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:45:51,458 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:45:51,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:45:51 BoogieIcfgContainer [2025-02-05 21:45:51,459 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:45:51,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:45:51,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:45:51,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:45:51,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:45:50" (1/3) ... [2025-02-05 21:45:51,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4ec846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:45:51, skipping insertion in model container [2025-02-05 21:45:51,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:45:50" (2/3) ... [2025-02-05 21:45:51,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4ec846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:45:51, skipping insertion in model container [2025-02-05 21:45:51,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:45:51" (3/3) ... [2025-02-05 21:45:51,470 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-34.i [2025-02-05 21:45:51,483 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:45:51,484 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-34.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:45:51,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:45:51,544 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;@5b672c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:45:51,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:45:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 21:45:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 21:45:51,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:45:51,561 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:45:51,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:45:51,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:45:51,565 INFO L85 PathProgramCache]: Analyzing trace with hash -477743295, now seen corresponding path program 1 times [2025-02-05 21:45:51,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:45:51,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23212637] [2025-02-05 21:45:51,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:45:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:45:51,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 21:45:51,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 21:45:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:45:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:45:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-02-05 21:45:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:45:51,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23212637] [2025-02-05 21:45:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23212637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:45:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78145227] [2025-02-05 21:45:51,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:45:51,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:45:51,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:45:51,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:45:51,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:45:52,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 21:45:52,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 21:45:52,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:45:52,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:45:52,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:45:52,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:45:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-02-05 21:45:52,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:45:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78145227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:45:52,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:45:52,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:45:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058823131] [2025-02-05 21:45:52,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:45:52,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:45:52,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:45:52,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:45:52,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:45:52,229 INFO L87 Difference]: Start difference. First operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 21:45:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:45:52,265 INFO L93 Difference]: Finished difference Result 190 states and 328 transitions. [2025-02-05 21:45:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:45:52,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 177 [2025-02-05 21:45:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:45:52,273 INFO L225 Difference]: With dead ends: 190 [2025-02-05 21:45:52,274 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 21:45:52,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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-02-05 21:45:52,280 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:45:52,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:45:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 21:45:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-05 21:45:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 21:45:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2025-02-05 21:45:52,318 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 177 [2025-02-05 21:45:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:45:52,318 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2025-02-05 21:45:52,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 21:45:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2025-02-05 21:45:52,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 21:45:52,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:45:52,322 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:45:52,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:45:52,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:45:52,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:45:52,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:45:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash -561648414, now seen corresponding path program 1 times [2025-02-05 21:45:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:45:52,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263182949] [2025-02-05 21:45:52,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:45:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:45:52,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 21:45:52,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 21:45:52,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:45:52,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:45:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:45:53,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:45:53,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263182949] [2025-02-05 21:45:53,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263182949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:45:53,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:45:53,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:45:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081998907] [2025-02-05 21:45:53,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:45:53,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:45:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:45:53,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:45:53,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:45:53,064 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:45:53,147 INFO L93 Difference]: Finished difference Result 279 states and 438 transitions. [2025-02-05 21:45:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:45:53,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-02-05 21:45:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:45:53,151 INFO L225 Difference]: With dead ends: 279 [2025-02-05 21:45:53,151 INFO L226 Difference]: Without dead ends: 187 [2025-02-05 21:45:53,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:45:53,155 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 143 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:45:53,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 362 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:45:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-05 21:45:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-02-05 21:45:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.4296875) internal successors, (183), 128 states have internal predecessors, (183), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 21:45:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 291 transitions. [2025-02-05 21:45:53,208 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 291 transitions. Word has length 177 [2025-02-05 21:45:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:45:53,209 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 291 transitions. [2025-02-05 21:45:53,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 291 transitions. [2025-02-05 21:45:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 21:45:53,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:45:53,212 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:45:53,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:45:53,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:45:53,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:45:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -350297501, now seen corresponding path program 1 times [2025-02-05 21:45:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:45:53,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803121027] [2025-02-05 21:45:53,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:45:53,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:45:53,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 21:45:53,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 21:45:53,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:45:53,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:45:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:45:53,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:45:53,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803121027] [2025-02-05 21:45:53,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803121027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:45:53,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:45:53,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:45:53,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976906725] [2025-02-05 21:45:53,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:45:53,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:45:53,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:45:53,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:45:53,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:45:53,616 INFO L87 Difference]: Start difference. First operand 185 states and 291 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:45:53,888 INFO L93 Difference]: Finished difference Result 607 states and 956 transitions. [2025-02-05 21:45:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:45:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-02-05 21:45:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:45:53,896 INFO L225 Difference]: With dead ends: 607 [2025-02-05 21:45:53,897 INFO L226 Difference]: Without dead ends: 425 [2025-02-05 21:45:53,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 21:45:53,901 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 154 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:45:53,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 448 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:45:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-02-05 21:45:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 369. [2025-02-05 21:45:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 256 states have (on average 1.421875) internal successors, (364), 256 states have internal predecessors, (364), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 21:45:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 580 transitions. [2025-02-05 21:45:53,983 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 580 transitions. Word has length 177 [2025-02-05 21:45:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:45:53,985 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 580 transitions. [2025-02-05 21:45:53,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 580 transitions. [2025-02-05 21:45:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 21:45:53,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:45:53,991 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:45:53,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:45:53,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:45:53,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:45:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1168845276, now seen corresponding path program 1 times [2025-02-05 21:45:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:45:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715072285] [2025-02-05 21:45:53,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:45:53,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:45:54,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 21:45:54,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 21:45:54,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:45:54,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:45:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:45:54,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:45:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715072285] [2025-02-05 21:45:54,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715072285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:45:54,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:45:54,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:45:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043370600] [2025-02-05 21:45:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:45:54,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:45:54,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:45:54,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:45:54,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:45:54,341 INFO L87 Difference]: Start difference. First operand 369 states and 580 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:45:54,753 INFO L93 Difference]: Finished difference Result 1090 states and 1711 transitions. [2025-02-05 21:45:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:45:54,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2025-02-05 21:45:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:45:54,760 INFO L225 Difference]: With dead ends: 1090 [2025-02-05 21:45:54,760 INFO L226 Difference]: Without dead ends: 724 [2025-02-05 21:45:54,762 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-02-05 21:45:54,763 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 173 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:45:54,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 563 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:45:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-02-05 21:45:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 377. [2025-02-05 21:45:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 264 states have (on average 1.4090909090909092) internal successors, (372), 264 states have internal predecessors, (372), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 21:45:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 588 transitions. [2025-02-05 21:45:54,862 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 588 transitions. Word has length 178 [2025-02-05 21:45:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:45:54,862 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 588 transitions. [2025-02-05 21:45:54,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 588 transitions. [2025-02-05 21:45:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 21:45:54,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:45:54,866 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:45:54,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:45:54,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:45:54,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:45:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1936599839, now seen corresponding path program 1 times [2025-02-05 21:45:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:45:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603232256] [2025-02-05 21:45:54,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:45:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:45:54,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 21:45:54,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 21:45:54,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:45:54,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:45:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:45:55,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:45:55,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603232256] [2025-02-05 21:45:55,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603232256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:45:55,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:45:55,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:45:55,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967935244] [2025-02-05 21:45:55,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:45:55,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:45:55,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:45:55,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:45:55,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:45:55,520 INFO L87 Difference]: Start difference. First operand 377 states and 588 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:45:55,906 INFO L93 Difference]: Finished difference Result 949 states and 1474 transitions. [2025-02-05 21:45:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:45:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-02-05 21:45:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:45:55,913 INFO L225 Difference]: With dead ends: 949 [2025-02-05 21:45:55,914 INFO L226 Difference]: Without dead ends: 575 [2025-02-05 21:45:55,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 21:45:55,919 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:45:55,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 369 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:45:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-05 21:45:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 465. [2025-02-05 21:45:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 324 states have (on average 1.4012345679012346) internal successors, (454), 324 states have internal predecessors, (454), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:45:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 724 transitions. [2025-02-05 21:45:56,031 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 724 transitions. Word has length 179 [2025-02-05 21:45:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:45:56,033 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 724 transitions. [2025-02-05 21:45:56,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 724 transitions. [2025-02-05 21:45:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 21:45:56,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:45:56,038 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:45:56,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:45:56,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:45:56,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:45:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1852808832, now seen corresponding path program 1 times [2025-02-05 21:45:56,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:45:56,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198393490] [2025-02-05 21:45:56,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:45:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:45:56,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 21:45:56,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 21:45:56,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:45:56,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:45:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:45:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:45:58,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198393490] [2025-02-05 21:45:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198393490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:45:58,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:45:58,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:45:58,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186446108] [2025-02-05 21:45:58,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:45:58,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:45:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:45:58,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:45:58,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:45:58,610 INFO L87 Difference]: Start difference. First operand 465 states and 724 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:45:59,175 INFO L93 Difference]: Finished difference Result 965 states and 1494 transitions. [2025-02-05 21:45:59,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:45:59,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-02-05 21:45:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:45:59,181 INFO L225 Difference]: With dead ends: 965 [2025-02-05 21:45:59,181 INFO L226 Difference]: Without dead ends: 591 [2025-02-05 21:45:59,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:45:59,184 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 173 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:45:59,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 447 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:45:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-02-05 21:45:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 477. [2025-02-05 21:45:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 336 states have (on average 1.3988095238095237) internal successors, (470), 336 states have internal predecessors, (470), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:45:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 740 transitions. [2025-02-05 21:45:59,253 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 740 transitions. Word has length 179 [2025-02-05 21:45:59,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:45:59,254 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 740 transitions. [2025-02-05 21:45:59,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:45:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 740 transitions. [2025-02-05 21:45:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 21:45:59,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:45:59,256 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:45:59,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:45:59,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:45:59,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:45:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash 892583771, now seen corresponding path program 1 times [2025-02-05 21:45:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:45:59,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816897340] [2025-02-05 21:45:59,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:45:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:45:59,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 21:45:59,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 21:45:59,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:45:59,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:46:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:46:06,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:46:06,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816897340] [2025-02-05 21:46:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816897340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:46:06,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:46:06,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:46:06,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676013202] [2025-02-05 21:46:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:46:06,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:46:06,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:46:06,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:46:06,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:46:06,593 INFO L87 Difference]: Start difference. First operand 477 states and 740 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:46:09,412 INFO L93 Difference]: Finished difference Result 1381 states and 2070 transitions. [2025-02-05 21:46:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:46:09,413 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-02-05 21:46:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:46:09,420 INFO L225 Difference]: With dead ends: 1381 [2025-02-05 21:46:09,421 INFO L226 Difference]: Without dead ends: 973 [2025-02-05 21:46:09,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:46:09,423 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 547 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:46:09,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 915 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:46:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-02-05 21:46:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 627. [2025-02-05 21:46:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 486 states have (on average 1.3991769547325104) internal successors, (680), 486 states have internal predecessors, (680), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:46:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 950 transitions. [2025-02-05 21:46:09,484 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 950 transitions. Word has length 179 [2025-02-05 21:46:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:46:09,485 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 950 transitions. [2025-02-05 21:46:09,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 950 transitions. [2025-02-05 21:46:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 21:46:09,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:46:09,487 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:46:09,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:46:09,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:46:09,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:46:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1780087452, now seen corresponding path program 1 times [2025-02-05 21:46:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:46:09,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667619347] [2025-02-05 21:46:09,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:46:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:46:09,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 21:46:09,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 21:46:09,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:46:09,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:46:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:46:11,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:46:11,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667619347] [2025-02-05 21:46:11,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667619347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:46:11,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:46:11,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:46:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146208613] [2025-02-05 21:46:11,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:46:11,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:46:11,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:46:11,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:46:11,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:46:11,469 INFO L87 Difference]: Start difference. First operand 627 states and 950 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:46:12,600 INFO L93 Difference]: Finished difference Result 1337 states and 2024 transitions. [2025-02-05 21:46:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:46:12,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-02-05 21:46:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:46:12,607 INFO L225 Difference]: With dead ends: 1337 [2025-02-05 21:46:12,607 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 21:46:12,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:46:12,610 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 357 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:46:12,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 571 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:46:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 21:46:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 709. [2025-02-05 21:46:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 568 states have (on average 1.3767605633802817) internal successors, (782), 568 states have internal predecessors, (782), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:46:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1052 transitions. [2025-02-05 21:46:12,686 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1052 transitions. Word has length 179 [2025-02-05 21:46:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:46:12,687 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1052 transitions. [2025-02-05 21:46:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1052 transitions. [2025-02-05 21:46:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 21:46:12,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:46:12,693 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:46:12,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:46:12,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:46:12,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:46:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash -914870692, now seen corresponding path program 1 times [2025-02-05 21:46:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:46:12,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899411074] [2025-02-05 21:46:12,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:46:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:46:12,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 21:46:12,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 21:46:12,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:46:12,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:46:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:46:14,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:46:14,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899411074] [2025-02-05 21:46:14,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899411074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:46:14,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:46:14,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:46:14,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865173767] [2025-02-05 21:46:14,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:46:14,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:46:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:46:14,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:46:14,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:46:14,248 INFO L87 Difference]: Start difference. First operand 709 states and 1052 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:46:15,067 INFO L93 Difference]: Finished difference Result 1321 states and 1964 transitions. [2025-02-05 21:46:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:46:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-02-05 21:46:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:46:15,073 INFO L225 Difference]: With dead ends: 1321 [2025-02-05 21:46:15,073 INFO L226 Difference]: Without dead ends: 911 [2025-02-05 21:46:15,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:46:15,077 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 276 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:46:15,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 634 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:46:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-02-05 21:46:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 705. [2025-02-05 21:46:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 564 states have (on average 1.3865248226950355) internal successors, (782), 564 states have internal predecessors, (782), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:46:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1052 transitions. [2025-02-05 21:46:15,135 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1052 transitions. Word has length 179 [2025-02-05 21:46:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:46:15,135 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1052 transitions. [2025-02-05 21:46:15,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1052 transitions. [2025-02-05 21:46:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 21:46:15,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:46:15,137 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:46:15,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:46:15,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:46:15,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:46:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1983263433, now seen corresponding path program 1 times [2025-02-05 21:46:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:46:15,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823448816] [2025-02-05 21:46:15,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:46:15,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:46:15,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 21:46:15,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 21:46:15,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:46:15,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:46:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:46:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:46:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823448816] [2025-02-05 21:46:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823448816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:46:17,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:46:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:46:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65459160] [2025-02-05 21:46:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:46:17,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:46:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:46:17,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:46:17,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:46:17,608 INFO L87 Difference]: Start difference. First operand 705 states and 1052 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:46:18,718 INFO L93 Difference]: Finished difference Result 1455 states and 2152 transitions. [2025-02-05 21:46:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:46:18,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-02-05 21:46:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:46:18,725 INFO L225 Difference]: With dead ends: 1455 [2025-02-05 21:46:18,726 INFO L226 Difference]: Without dead ends: 1081 [2025-02-05 21:46:18,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:46:18,728 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 419 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:46:18,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 760 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:46:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-02-05 21:46:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 753. [2025-02-05 21:46:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 608 states have (on average 1.3651315789473684) internal successors, (830), 608 states have internal predecessors, (830), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:46:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1100 transitions. [2025-02-05 21:46:18,803 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1100 transitions. Word has length 180 [2025-02-05 21:46:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:46:18,804 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1100 transitions. [2025-02-05 21:46:18,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1100 transitions. [2025-02-05 21:46:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 21:46:18,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:46:18,807 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:46:18,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:46:18,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:46:18,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:46:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1514009647, now seen corresponding path program 1 times [2025-02-05 21:46:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:46:18,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109993427] [2025-02-05 21:46:18,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:46:18,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:46:18,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 21:46:18,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 21:46:18,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:46:18,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:46:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:46:22,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:46:22,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109993427] [2025-02-05 21:46:22,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109993427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:46:22,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:46:22,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:46:22,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488645127] [2025-02-05 21:46:22,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:46:22,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:46:22,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:46:22,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:46:22,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:46:22,724 INFO L87 Difference]: Start difference. First operand 753 states and 1100 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:46:24,861 INFO L93 Difference]: Finished difference Result 1651 states and 2385 transitions. [2025-02-05 21:46:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:46:24,861 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-02-05 21:46:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:46:24,869 INFO L225 Difference]: With dead ends: 1651 [2025-02-05 21:46:24,869 INFO L226 Difference]: Without dead ends: 1051 [2025-02-05 21:46:24,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2025-02-05 21:46:24,871 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 409 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:46:24,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 890 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:46:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-02-05 21:46:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 835. [2025-02-05 21:46:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 690 states have (on average 1.373913043478261) internal successors, (948), 690 states have internal predecessors, (948), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:46:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1218 transitions. [2025-02-05 21:46:24,934 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1218 transitions. Word has length 180 [2025-02-05 21:46:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:46:24,935 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1218 transitions. [2025-02-05 21:46:24,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1218 transitions. [2025-02-05 21:46:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 21:46:24,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:46:24,937 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:46:24,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:46:24,937 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:46:24,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:46:24,938 INFO L85 PathProgramCache]: Analyzing trace with hash 973503186, now seen corresponding path program 1 times [2025-02-05 21:46:24,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:46:24,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349853195] [2025-02-05 21:46:24,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:46:24,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:46:24,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 21:46:25,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 21:46:25,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:46:25,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:46:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:46:29,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:46:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349853195] [2025-02-05 21:46:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349853195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:46:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:46:29,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:46:29,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128782473] [2025-02-05 21:46:29,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:46:29,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:46:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:46:29,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:46:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:46:29,518 INFO L87 Difference]: Start difference. First operand 835 states and 1218 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:46:31,837 INFO L93 Difference]: Finished difference Result 1461 states and 2111 transitions. [2025-02-05 21:46:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:46:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-02-05 21:46:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:46:31,841 INFO L225 Difference]: With dead ends: 1461 [2025-02-05 21:46:31,842 INFO L226 Difference]: Without dead ends: 1055 [2025-02-05 21:46:31,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2025-02-05 21:46:31,843 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 252 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:46:31,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1095 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:46:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-02-05 21:46:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 819. [2025-02-05 21:46:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 674 states have (on average 1.3768545994065282) internal successors, (928), 674 states have internal predecessors, (928), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:46:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1198 transitions. [2025-02-05 21:46:31,909 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1198 transitions. Word has length 180 [2025-02-05 21:46:31,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:46:31,909 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1198 transitions. [2025-02-05 21:46:31,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1198 transitions. [2025-02-05 21:46:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 21:46:31,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:46:31,913 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:46:31,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:46:31,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:46:31,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:46:31,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1455902975, now seen corresponding path program 1 times [2025-02-05 21:46:31,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:46:31,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402557352] [2025-02-05 21:46:31,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:46:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:46:31,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 21:46:31,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 21:46:31,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:46:31,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:46:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:46:37,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:46:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402557352] [2025-02-05 21:46:37,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402557352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:46:37,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:46:37,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 21:46:37,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963108255] [2025-02-05 21:46:37,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:46:37,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:46:37,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:46:37,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:46:37,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:46:37,674 INFO L87 Difference]: Start difference. First operand 819 states and 1198 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:46:40,973 INFO L93 Difference]: Finished difference Result 1623 states and 2370 transitions. [2025-02-05 21:46:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 21:46:40,974 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-02-05 21:46:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:46:40,979 INFO L225 Difference]: With dead ends: 1623 [2025-02-05 21:46:40,979 INFO L226 Difference]: Without dead ends: 1217 [2025-02-05 21:46:40,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 21:46:40,981 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 411 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:46:40,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 864 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:46:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-02-05 21:46:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 815. [2025-02-05 21:46:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 670 states have (on average 1.3791044776119403) internal successors, (924), 670 states have internal predecessors, (924), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:46:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1194 transitions. [2025-02-05 21:46:41,045 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1194 transitions. Word has length 181 [2025-02-05 21:46:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:46:41,045 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1194 transitions. [2025-02-05 21:46:41,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1194 transitions. [2025-02-05 21:46:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 21:46:41,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:46:41,047 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:46:41,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:46:41,047 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:46:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:46:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash -976107616, now seen corresponding path program 1 times [2025-02-05 21:46:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:46:41,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727979300] [2025-02-05 21:46:41,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:46:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:46:41,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 21:46:41,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 21:46:41,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:46:41,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:46:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:46:44,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:46:44,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727979300] [2025-02-05 21:46:44,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727979300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:46:44,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:46:44,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 21:46:44,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359787076] [2025-02-05 21:46:44,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:46:44,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 21:46:44,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:46:44,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 21:46:44,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:46:44,383 INFO L87 Difference]: Start difference. First operand 815 states and 1194 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:46:48,581 INFO L93 Difference]: Finished difference Result 1723 states and 2525 transitions. [2025-02-05 21:46:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 21:46:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-02-05 21:46:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:46:48,587 INFO L225 Difference]: With dead ends: 1723 [2025-02-05 21:46:48,587 INFO L226 Difference]: Without dead ends: 1305 [2025-02-05 21:46:48,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:46:48,589 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 353 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:46:48,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 640 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:46:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2025-02-05 21:46:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 871. [2025-02-05 21:46:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 726 states have (on average 1.3829201101928374) internal successors, (1004), 726 states have internal predecessors, (1004), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:46:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1274 transitions. [2025-02-05 21:46:48,664 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1274 transitions. Word has length 181 [2025-02-05 21:46:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:46:48,665 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1274 transitions. [2025-02-05 21:46:48,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1274 transitions. [2025-02-05 21:46:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 21:46:48,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:46:48,667 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:46:48,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:46:48,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:46:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:46:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 623901536, now seen corresponding path program 1 times [2025-02-05 21:46:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:46:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781504304] [2025-02-05 21:46:48,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:46:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:46:48,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 21:46:48,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 21:46:48,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:46:48,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:46:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:46:53,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:46:53,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781504304] [2025-02-05 21:46:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781504304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:46:53,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:46:53,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:46:53,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722301754] [2025-02-05 21:46:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:46:53,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:46:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:46:53,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:46:53,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:46:53,289 INFO L87 Difference]: Start difference. First operand 871 states and 1274 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:46:54,452 INFO L93 Difference]: Finished difference Result 1775 states and 2583 transitions. [2025-02-05 21:46:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 21:46:54,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-02-05 21:46:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:46:54,457 INFO L225 Difference]: With dead ends: 1775 [2025-02-05 21:46:54,458 INFO L226 Difference]: Without dead ends: 1171 [2025-02-05 21:46:54,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:46:54,461 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 382 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:46:54,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 684 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:46:54,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-02-05 21:46:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 879. [2025-02-05 21:46:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 734 states have (on average 1.3705722070844686) internal successors, (1006), 734 states have internal predecessors, (1006), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:46:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1276 transitions. [2025-02-05 21:46:54,545 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1276 transitions. Word has length 181 [2025-02-05 21:46:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:46:54,546 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1276 transitions. [2025-02-05 21:46:54,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:46:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1276 transitions. [2025-02-05 21:46:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 21:46:54,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:46:54,547 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:46:54,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:46:54,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:46:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:46:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1511405217, now seen corresponding path program 1 times [2025-02-05 21:46:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:46:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530362764] [2025-02-05 21:46:54,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:46:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:46:54,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 21:46:54,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 21:46:54,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:46:54,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 21:47:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:47:00,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530362764] [2025-02-05 21:47:00,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530362764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:00,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:47:00,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 21:47:00,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533516428] [2025-02-05 21:47:00,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:00,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:47:00,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:47:00,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:47:00,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:47:00,318 INFO L87 Difference]: Start difference. First operand 879 states and 1276 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:47:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:02,536 INFO L93 Difference]: Finished difference Result 1727 states and 2440 transitions. [2025-02-05 21:47:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:47:02,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-02-05 21:47:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:02,541 INFO L225 Difference]: With dead ends: 1727 [2025-02-05 21:47:02,541 INFO L226 Difference]: Without dead ends: 1277 [2025-02-05 21:47:02,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:47:02,542 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 328 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:02,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 851 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 21:47:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-02-05 21:47:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 931. [2025-02-05 21:47:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 786 states have (on average 1.3638676844783715) internal successors, (1072), 786 states have internal predecessors, (1072), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:47:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1342 transitions. [2025-02-05 21:47:02,611 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1342 transitions. Word has length 181 [2025-02-05 21:47:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:02,612 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1342 transitions. [2025-02-05 21:47:02,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 21:47:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1342 transitions. [2025-02-05 21:47:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 21:47:02,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:02,614 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:47:02,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:47:02,614 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:02,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:02,615 INFO L85 PathProgramCache]: Analyzing trace with hash 399262388, now seen corresponding path program 1 times [2025-02-05 21:47:02,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:02,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17650809] [2025-02-05 21:47:02,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:02,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 21:47:02,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 21:47:02,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:02,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat