./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.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_fillercodestructure_filler-pr-cn_file-81.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 c37c06019a2f7252c23194b0baf4adc5534d367e32a3abf21b53b0028081fdaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:15:18,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:15:18,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:15:18,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:15:18,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:15:18,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:15:18,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:15:18,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:15:18,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:15:18,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:15:18,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:15:18,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:15:18,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:15:18,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:15:18,131 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:15:18,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:15:18,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:15:18,133 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:15:18,133 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:15:18,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:15:18,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:15:18,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:15:18,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:15:18,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:15:18,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:15:18,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:15:18,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:15:18,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:15:18,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:15:18,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:15:18,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:15:18,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:15:18,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:15:18,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:15:18,134 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 -> c37c06019a2f7252c23194b0baf4adc5534d367e32a3abf21b53b0028081fdaa [2025-02-05 23:15:18,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:15:18,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:15:18,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:15:18,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:15:18,358 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:15:18,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-02-05 23:15:19,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46c0a3b0f/600c490cc1ab47a08418d562df5eeb6a/FLAG951a84a14 [2025-02-05 23:15:19,667 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:15:19,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-02-05 23:15:19,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46c0a3b0f/600c490cc1ab47a08418d562df5eeb6a/FLAG951a84a14 [2025-02-05 23:15:19,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46c0a3b0f/600c490cc1ab47a08418d562df5eeb6a [2025-02-05 23:15:19,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:15:19,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:15:19,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:15:19,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:15:19,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:15:19,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:19,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e4d841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19, skipping insertion in model container [2025-02-05 23:15:19,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:19,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:15:19,821 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_fillercodestructure_filler-pr-cn_file-81.i[919,932] [2025-02-05 23:15:19,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:15:19,904 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:15:19,914 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_fillercodestructure_filler-pr-cn_file-81.i[919,932] [2025-02-05 23:15:19,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:15:19,969 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:15:19,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19 WrapperNode [2025-02-05 23:15:19,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:15:19,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:15:19,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:15:19,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:15:19,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:19,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,028 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-02-05 23:15:20,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:15:20,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:15:20,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:15:20,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:15:20,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,052 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 23:15:20,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:15:20,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:15:20,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:15:20,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:15:20,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (1/1) ... [2025-02-05 23:15:20,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:15:20,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:15:20,098 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 23:15:20,102 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 23:15:20,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:15:20,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:15:20,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:15:20,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:15:20,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:15:20,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:15:20,186 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:15:20,188 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:15:20,545 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-02-05 23:15:20,584 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 23:15:20,585 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:15:20,607 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:15:20,608 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:15:20,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:15:20 BoogieIcfgContainer [2025-02-05 23:15:20,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:15:20,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:15:20,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:15:20,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:15:20,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:15:19" (1/3) ... [2025-02-05 23:15:20,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3350cee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:15:20, skipping insertion in model container [2025-02-05 23:15:20,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:15:19" (2/3) ... [2025-02-05 23:15:20,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3350cee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:15:20, skipping insertion in model container [2025-02-05 23:15:20,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:15:20" (3/3) ... [2025-02-05 23:15:20,615 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-02-05 23:15:20,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:15:20,627 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:15:20,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:15:20,694 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;@175c8ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:15:20,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:15:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 23:15:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 23:15:20,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:15:20,715 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:15:20,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:15:20,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:15:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash 32893380, now seen corresponding path program 1 times [2025-02-05 23:15:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:15:20,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710114528] [2025-02-05 23:15:20,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:15:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:15:20,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 23:15:20,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 23:15:20,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:15:20,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:15:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-02-05 23:15:21,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:15:21,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710114528] [2025-02-05 23:15:21,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710114528] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:15:21,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566638779] [2025-02-05 23:15:21,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:15:21,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:15:21,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:15:21,076 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 23:15:21,077 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 23:15:21,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 23:15:21,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 23:15:21,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:15:21,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:15:21,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:15:21,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:15:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-02-05 23:15:21,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:15:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566638779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:15:21,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:15:21,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:15:21,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139320177] [2025-02-05 23:15:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:15:21,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:15:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:15:21,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:15:21,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:15:21,332 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-05 23:15:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:15:21,399 INFO L93 Difference]: Finished difference Result 260 states and 471 transitions. [2025-02-05 23:15:21,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:15:21,401 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 306 [2025-02-05 23:15:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:15:21,407 INFO L225 Difference]: With dead ends: 260 [2025-02-05 23:15:21,407 INFO L226 Difference]: Without dead ends: 130 [2025-02-05 23:15:21,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 307 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 23:15:21,414 INFO L435 NwaCegarLoop]: 204 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, 204 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 23:15:21,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:15:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-05 23:15:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-05 23:15:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 23:15:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2025-02-05 23:15:21,463 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 306 [2025-02-05 23:15:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:15:21,463 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2025-02-05 23:15:21,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-05 23:15:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2025-02-05 23:15:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 23:15:21,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:15:21,470 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:15:21,477 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 23:15:21,671 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 23:15:21,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:15:21,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:15:21,672 INFO L85 PathProgramCache]: Analyzing trace with hash 465542560, now seen corresponding path program 1 times [2025-02-05 23:15:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:15:21,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241194643] [2025-02-05 23:15:21,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:15:21,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:15:21,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 23:15:21,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 23:15:21,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:15:21,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:15:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:15:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:15:22,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241194643] [2025-02-05 23:15:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241194643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:15:22,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:15:22,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:15:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897401171] [2025-02-05 23:15:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:15:22,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:15:22,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:15:22,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:15:22,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:15:22,505 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:15:22,834 INFO L93 Difference]: Finished difference Result 385 states and 620 transitions. [2025-02-05 23:15:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:15:22,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 306 [2025-02-05 23:15:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:15:22,838 INFO L225 Difference]: With dead ends: 385 [2025-02-05 23:15:22,838 INFO L226 Difference]: Without dead ends: 258 [2025-02-05 23:15:22,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:15:22,845 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 114 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:15:22,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 522 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:15:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-05 23:15:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-02-05 23:15:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 153 states have (on average 1.392156862745098) internal successors, (213), 153 states have internal predecessors, (213), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:15:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 413 transitions. [2025-02-05 23:15:22,962 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 413 transitions. Word has length 306 [2025-02-05 23:15:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:15:22,963 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 413 transitions. [2025-02-05 23:15:22,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 413 transitions. [2025-02-05 23:15:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 23:15:22,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:15:22,968 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:15:22,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:15:22,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:15:22,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:15:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1160499125, now seen corresponding path program 1 times [2025-02-05 23:15:22,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:15:22,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263538299] [2025-02-05 23:15:22,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:15:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:15:22,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 23:15:23,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 23:15:23,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:15:23,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:15:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:15:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:15:24,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263538299] [2025-02-05 23:15:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263538299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:15:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:15:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:15:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144657628] [2025-02-05 23:15:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:15:24,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:15:24,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:15:24,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:15:24,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:15:24,177 INFO L87 Difference]: Start difference. First operand 256 states and 413 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:15:25,900 INFO L93 Difference]: Finished difference Result 1904 states and 3045 transitions. [2025-02-05 23:15:25,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:15:25,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-02-05 23:15:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:15:25,919 INFO L225 Difference]: With dead ends: 1904 [2025-02-05 23:15:25,920 INFO L226 Difference]: Without dead ends: 1651 [2025-02-05 23:15:25,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:15:25,924 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 709 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:15:25,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 2024 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 23:15:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2025-02-05 23:15:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1369. [2025-02-05 23:15:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 848 states have (on average 1.4127358490566038) internal successors, (1198), 852 states have internal predecessors, (1198), 504 states have call successors, (504), 16 states have call predecessors, (504), 16 states have return successors, (504), 500 states have call predecessors, (504), 504 states have call successors, (504) [2025-02-05 23:15:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2206 transitions. [2025-02-05 23:15:26,177 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2206 transitions. Word has length 307 [2025-02-05 23:15:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:15:26,177 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2206 transitions. [2025-02-05 23:15:26,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2206 transitions. [2025-02-05 23:15:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 23:15:26,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:15:26,180 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:15:26,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:15:26,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:15:26,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:15:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1560767634, now seen corresponding path program 1 times [2025-02-05 23:15:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:15:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935770113] [2025-02-05 23:15:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:15:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:15:26,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 23:15:26,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 23:15:26,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:15:26,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:15:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:15:35,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:15:35,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935770113] [2025-02-05 23:15:35,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935770113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:15:35,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:15:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:15:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124936255] [2025-02-05 23:15:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:15:35,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:15:35,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:15:35,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:15:35,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:15:35,593 INFO L87 Difference]: Start difference. First operand 1369 states and 2206 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:15:39,753 INFO L93 Difference]: Finished difference Result 4540 states and 7258 transitions. [2025-02-05 23:15:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:15:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-02-05 23:15:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:15:39,771 INFO L225 Difference]: With dead ends: 4540 [2025-02-05 23:15:39,772 INFO L226 Difference]: Without dead ends: 3174 [2025-02-05 23:15:39,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-02-05 23:15:39,779 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1269 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:15:39,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1195 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 23:15:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2025-02-05 23:15:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 1662. [2025-02-05 23:15:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1089 states have (on average 1.43801652892562) internal successors, (1566), 1093 states have internal predecessors, (1566), 554 states have call successors, (554), 18 states have call predecessors, (554), 18 states have return successors, (554), 550 states have call predecessors, (554), 554 states have call successors, (554) [2025-02-05 23:15:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2674 transitions. [2025-02-05 23:15:39,976 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2674 transitions. Word has length 307 [2025-02-05 23:15:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:15:39,979 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2674 transitions. [2025-02-05 23:15:39,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:39,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2674 transitions. [2025-02-05 23:15:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 23:15:39,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:15:39,983 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:15:39,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:15:39,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:15:39,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:15:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1226647853, now seen corresponding path program 1 times [2025-02-05 23:15:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:15:39,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496544348] [2025-02-05 23:15:39,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:15:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:15:39,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 23:15:40,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 23:15:40,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:15:40,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:15:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:15:40,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:15:40,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496544348] [2025-02-05 23:15:40,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496544348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:15:40,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:15:40,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:15:40,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750594471] [2025-02-05 23:15:40,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:15:40,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:15:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:15:40,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:15:40,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:15:40,329 INFO L87 Difference]: Start difference. First operand 1662 states and 2674 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:15:40,503 INFO L93 Difference]: Finished difference Result 3666 states and 5884 transitions. [2025-02-05 23:15:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:15:40,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-02-05 23:15:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:15:40,520 INFO L225 Difference]: With dead ends: 3666 [2025-02-05 23:15:40,520 INFO L226 Difference]: Without dead ends: 2300 [2025-02-05 23:15:40,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:15:40,526 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 72 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:15:40,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 603 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:15:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2025-02-05 23:15:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2286. [2025-02-05 23:15:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 1653 states have (on average 1.4688445251058682) internal successors, (2428), 1669 states have internal predecessors, (2428), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:15:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3632 transitions. [2025-02-05 23:15:40,714 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3632 transitions. Word has length 307 [2025-02-05 23:15:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:15:40,716 INFO L471 AbstractCegarLoop]: Abstraction has 2286 states and 3632 transitions. [2025-02-05 23:15:40,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3632 transitions. [2025-02-05 23:15:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 23:15:40,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:15:40,722 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:15:40,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:15:40,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:15:40,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:15:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash 563695281, now seen corresponding path program 1 times [2025-02-05 23:15:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:15:40,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765994681] [2025-02-05 23:15:40,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:15:40,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:15:40,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 23:15:40,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 23:15:40,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:15:40,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:15:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:15:48,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:15:48,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765994681] [2025-02-05 23:15:48,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765994681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:15:48,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:15:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:15:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399087748] [2025-02-05 23:15:48,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:15:48,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:15:48,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:15:48,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:15:48,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:15:48,154 INFO L87 Difference]: Start difference. First operand 2286 states and 3632 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-05 23:15:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:15:50,904 INFO L93 Difference]: Finished difference Result 5694 states and 8976 transitions. [2025-02-05 23:15:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:15:50,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2025-02-05 23:15:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:15:50,923 INFO L225 Difference]: With dead ends: 5694 [2025-02-05 23:15:50,924 INFO L226 Difference]: Without dead ends: 3704 [2025-02-05 23:15:50,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2025-02-05 23:15:50,930 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 796 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:15:50,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1273 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:15:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2025-02-05 23:15:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 2286. [2025-02-05 23:15:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 1653 states have (on average 1.4688445251058682) internal successors, (2428), 1669 states have internal predecessors, (2428), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:15:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3632 transitions. [2025-02-05 23:15:51,221 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3632 transitions. Word has length 307 [2025-02-05 23:15:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:15:51,222 INFO L471 AbstractCegarLoop]: Abstraction has 2286 states and 3632 transitions. [2025-02-05 23:15:51,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-05 23:15:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3632 transitions. [2025-02-05 23:15:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 23:15:51,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:15:51,227 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:15:51,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:15:51,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:15:51,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:15:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash 716295763, now seen corresponding path program 1 times [2025-02-05 23:15:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:15:51,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764598055] [2025-02-05 23:15:51,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:15:51,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:15:51,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 23:15:51,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 23:15:51,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:15:51,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:15:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:15:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:15:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764598055] [2025-02-05 23:15:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764598055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:15:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:15:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:15:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100233493] [2025-02-05 23:15:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:15:51,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:15:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:15:51,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:15:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:15:51,927 INFO L87 Difference]: Start difference. First operand 2286 states and 3632 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:15:52,877 INFO L93 Difference]: Finished difference Result 5977 states and 9450 transitions. [2025-02-05 23:15:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:15:52,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-02-05 23:15:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:15:52,896 INFO L225 Difference]: With dead ends: 5977 [2025-02-05 23:15:52,896 INFO L226 Difference]: Without dead ends: 3987 [2025-02-05 23:15:52,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:15:52,904 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 614 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:15:52,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 888 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:15:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2025-02-05 23:15:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 2300. [2025-02-05 23:15:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 1667 states have (on average 1.4691061787642472) internal successors, (2449), 1683 states have internal predecessors, (2449), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:15:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 3653 transitions. [2025-02-05 23:15:53,102 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 3653 transitions. Word has length 307 [2025-02-05 23:15:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:15:53,103 INFO L471 AbstractCegarLoop]: Abstraction has 2300 states and 3653 transitions. [2025-02-05 23:15:53,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:15:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 3653 transitions. [2025-02-05 23:15:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 23:15:53,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:15:53,108 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:15:53,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:15:53,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:15:53,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:15:53,109 INFO L85 PathProgramCache]: Analyzing trace with hash -477288655, now seen corresponding path program 1 times [2025-02-05 23:15:53,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:15:53,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905578283] [2025-02-05 23:15:53,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:15:53,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:15:53,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 23:15:53,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 23:15:53,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:15:53,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:16:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:16:01,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:16:01,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905578283] [2025-02-05 23:16:01,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905578283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:16:01,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:16:01,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:16:01,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251518431] [2025-02-05 23:16:01,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:16:01,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:16:01,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:16:01,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:16:01,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:16:01,407 INFO L87 Difference]: Start difference. First operand 2300 states and 3653 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:16:03,120 INFO L93 Difference]: Finished difference Result 5890 states and 9278 transitions. [2025-02-05 23:16:03,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:16:03,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-02-05 23:16:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:16:03,136 INFO L225 Difference]: With dead ends: 5890 [2025-02-05 23:16:03,136 INFO L226 Difference]: Without dead ends: 3900 [2025-02-05 23:16:03,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:16:03,143 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 910 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:16:03,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 960 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:16:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3900 states. [2025-02-05 23:16:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3900 to 2308. [2025-02-05 23:16:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 1675 states have (on average 1.4704477611940299) internal successors, (2463), 1691 states have internal predecessors, (2463), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:16:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3667 transitions. [2025-02-05 23:16:03,327 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3667 transitions. Word has length 307 [2025-02-05 23:16:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:16:03,328 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 3667 transitions. [2025-02-05 23:16:03,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3667 transitions. [2025-02-05 23:16:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 23:16:03,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:16:03,332 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:16:03,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:16:03,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:16:03,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:16:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1474361008, now seen corresponding path program 1 times [2025-02-05 23:16:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:16:03,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311469317] [2025-02-05 23:16:03,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:16:03,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:16:03,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 23:16:03,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 23:16:03,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:16:03,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:16:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:16:09,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:16:09,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311469317] [2025-02-05 23:16:09,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311469317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:16:09,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:16:09,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:16:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117435252] [2025-02-05 23:16:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:16:09,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:16:09,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:16:09,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:16:09,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:16:09,227 INFO L87 Difference]: Start difference. First operand 2308 states and 3667 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:16:10,755 INFO L93 Difference]: Finished difference Result 5070 states and 8034 transitions. [2025-02-05 23:16:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:16:10,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-02-05 23:16:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:16:10,768 INFO L225 Difference]: With dead ends: 5070 [2025-02-05 23:16:10,769 INFO L226 Difference]: Without dead ends: 3080 [2025-02-05 23:16:10,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:16:10,774 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 336 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:16:10,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 792 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:16:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2025-02-05 23:16:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 2416. [2025-02-05 23:16:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1783 states have (on average 1.4845765563656759) internal successors, (2647), 1799 states have internal predecessors, (2647), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:16:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3851 transitions. [2025-02-05 23:16:10,962 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3851 transitions. Word has length 307 [2025-02-05 23:16:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:16:10,962 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3851 transitions. [2025-02-05 23:16:10,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3851 transitions. [2025-02-05 23:16:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 23:16:10,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:16:10,969 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:16:10,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:16:10,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:16:10,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:16:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1321760526, now seen corresponding path program 1 times [2025-02-05 23:16:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:16:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577085408] [2025-02-05 23:16:10,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:16:10,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:16:10,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 23:16:10,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 23:16:10,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:16:10,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:16:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:16:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:16:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577085408] [2025-02-05 23:16:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577085408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:16:11,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:16:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 23:16:11,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892294235] [2025-02-05 23:16:11,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:16:11,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 23:16:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:16:11,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 23:16:11,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:16:11,365 INFO L87 Difference]: Start difference. First operand 2416 states and 3851 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:16:11,898 INFO L93 Difference]: Finished difference Result 5466 states and 8689 transitions. [2025-02-05 23:16:11,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:16:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-02-05 23:16:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:16:11,915 INFO L225 Difference]: With dead ends: 5466 [2025-02-05 23:16:11,917 INFO L226 Difference]: Without dead ends: 3168 [2025-02-05 23:16:11,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:16:11,922 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 259 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:16:11,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 762 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:16:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2025-02-05 23:16:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 2416. [2025-02-05 23:16:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1783 states have (on average 1.4845765563656759) internal successors, (2647), 1799 states have internal predecessors, (2647), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:16:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3851 transitions. [2025-02-05 23:16:12,098 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3851 transitions. Word has length 307 [2025-02-05 23:16:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:16:12,099 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3851 transitions. [2025-02-05 23:16:12,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3851 transitions. [2025-02-05 23:16:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 23:16:12,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:16:12,101 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:16:12,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 23:16:12,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:16:12,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:16:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1167060494, now seen corresponding path program 1 times [2025-02-05 23:16:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:16:12,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531398191] [2025-02-05 23:16:12,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:16:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:16:12,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 23:16:12,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 23:16:12,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:16:12,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:16:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:16:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:16:17,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531398191] [2025-02-05 23:16:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531398191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:16:17,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:16:17,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:16:17,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040540602] [2025-02-05 23:16:17,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:16:17,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:16:17,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:16:17,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:16:17,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:16:17,702 INFO L87 Difference]: Start difference. First operand 2416 states and 3851 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:16:19,093 INFO L93 Difference]: Finished difference Result 7615 states and 12002 transitions. [2025-02-05 23:16:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:16:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-02-05 23:16:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:16:19,126 INFO L225 Difference]: With dead ends: 7615 [2025-02-05 23:16:19,126 INFO L226 Difference]: Without dead ends: 5317 [2025-02-05 23:16:19,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-05 23:16:19,133 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 873 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:16:19,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1097 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:16:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2025-02-05 23:16:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 2447. [2025-02-05 23:16:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 1814 states have (on average 1.4906284454244763) internal successors, (2704), 1830 states have internal predecessors, (2704), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:16:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3908 transitions. [2025-02-05 23:16:19,343 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3908 transitions. Word has length 308 [2025-02-05 23:16:19,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:16:19,344 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 3908 transitions. [2025-02-05 23:16:19,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3908 transitions. [2025-02-05 23:16:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 23:16:19,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:16:19,347 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:16:19,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:16:19,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:16:19,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:16:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1620354993, now seen corresponding path program 1 times [2025-02-05 23:16:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:16:19,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859492932] [2025-02-05 23:16:19,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:16:19,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:16:19,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 23:16:19,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 23:16:19,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:16:19,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:16:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:16:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:16:25,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859492932] [2025-02-05 23:16:25,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859492932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:16:25,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:16:25,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:16:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625481051] [2025-02-05 23:16:25,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:16:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:16:25,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:16:25,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:16:25,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:16:25,466 INFO L87 Difference]: Start difference. First operand 2447 states and 3908 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:16:27,899 INFO L93 Difference]: Finished difference Result 6761 states and 10705 transitions. [2025-02-05 23:16:27,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:16:27,900 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-02-05 23:16:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:16:27,914 INFO L225 Difference]: With dead ends: 6761 [2025-02-05 23:16:27,914 INFO L226 Difference]: Without dead ends: 4463 [2025-02-05 23:16:27,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-02-05 23:16:27,921 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 443 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:16:27,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1357 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 23:16:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4463 states. [2025-02-05 23:16:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4463 to 2645. [2025-02-05 23:16:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2012 states have (on average 1.5009940357852882) internal successors, (3020), 2028 states have internal predecessors, (3020), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:16:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4224 transitions. [2025-02-05 23:16:28,124 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4224 transitions. Word has length 308 [2025-02-05 23:16:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:16:28,125 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 4224 transitions. [2025-02-05 23:16:28,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4224 transitions. [2025-02-05 23:16:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 23:16:28,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:16:28,128 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:16:28,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 23:16:28,129 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:16:28,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:16:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash 169988141, now seen corresponding path program 1 times [2025-02-05 23:16:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:16:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181184964] [2025-02-05 23:16:28,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:16:28,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:16:28,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 23:16:28,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 23:16:28,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:16:28,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:16:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:16:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:16:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181184964] [2025-02-05 23:16:31,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181184964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:16:31,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:16:31,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:16:31,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717342545] [2025-02-05 23:16:31,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:16:31,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:16:31,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:16:31,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:16:31,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:16:31,349 INFO L87 Difference]: Start difference. First operand 2645 states and 4224 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:16:33,118 INFO L93 Difference]: Finished difference Result 7259 states and 11467 transitions. [2025-02-05 23:16:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:16:33,119 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-02-05 23:16:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:16:33,146 INFO L225 Difference]: With dead ends: 7259 [2025-02-05 23:16:33,147 INFO L226 Difference]: Without dead ends: 4961 [2025-02-05 23:16:33,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-02-05 23:16:33,154 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 685 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:16:33,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1199 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 23:16:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4961 states. [2025-02-05 23:16:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4961 to 2661. [2025-02-05 23:16:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2028 states have (on average 1.504930966469428) internal successors, (3052), 2044 states have internal predecessors, (3052), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:16:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4256 transitions. [2025-02-05 23:16:33,375 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4256 transitions. Word has length 308 [2025-02-05 23:16:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:16:33,375 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 4256 transitions. [2025-02-05 23:16:33,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-05 23:16:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4256 transitions. [2025-02-05 23:16:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 23:16:33,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:16:33,378 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:16:33,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 23:16:33,378 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:16:33,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:16:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1677539950, now seen corresponding path program 1 times [2025-02-05 23:16:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:16:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521241832] [2025-02-05 23:16:33,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:16:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:16:33,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 23:16:33,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 23:16:33,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:16:33,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:16:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:16:38,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:16:38,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521241832] [2025-02-05 23:16:38,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521241832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:16:38,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:16:38,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:16:38,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655512293] [2025-02-05 23:16:38,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:16:38,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:16:38,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:16:38,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:16:38,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:16:38,371 INFO L87 Difference]: Start difference. First operand 2661 states and 4256 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-05 23:16:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:16:40,320 INFO L93 Difference]: Finished difference Result 6951 states and 10999 transitions. [2025-02-05 23:16:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:16:40,321 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-02-05 23:16:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:16:40,335 INFO L225 Difference]: With dead ends: 6951 [2025-02-05 23:16:40,335 INFO L226 Difference]: Without dead ends: 4653 [2025-02-05 23:16:40,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-02-05 23:16:40,345 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 771 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:16:40,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1364 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 23:16:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2025-02-05 23:16:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 2645. [2025-02-05 23:16:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2012 states have (on average 1.5009940357852882) internal successors, (3020), 2028 states have internal predecessors, (3020), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 23:16:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4224 transitions. [2025-02-05 23:16:40,552 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4224 transitions. Word has length 308 [2025-02-05 23:16:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:16:40,552 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 4224 transitions. [2025-02-05 23:16:40,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-05 23:16:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4224 transitions. [2025-02-05 23:16:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 23:16:40,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:16:40,555 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:16:40,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 23:16:40,555 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:16:40,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:16:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -870995795, now seen corresponding path program 1 times [2025-02-05 23:16:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:16:40,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277767215] [2025-02-05 23:16:40,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:16:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:16:40,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 23:16:40,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 23:16:40,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:16:40,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:16:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 23:16:44,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:16:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277767215] [2025-02-05 23:16:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277767215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:16:44,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:16:44,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:16:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92315045] [2025-02-05 23:16:44,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:16:44,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:16:44,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:16:44,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:16:44,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:16:44,900 INFO L87 Difference]: Start difference. First operand 2645 states and 4224 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50)