./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_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-co_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 d402cd14beee6851ca97c58b2a2589220820214ac9c394c1c5bdac6dbc1a1025 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:27:18,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:27:18,658 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:27:18,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:27:18,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:27:18,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:27:18,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:27:18,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:27:18,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:27:18,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:27:18,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:27:18,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:27:18,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:27:18,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:27:18,695 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:27:18,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:27:18,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:27:18,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:27:18,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:27:18,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:27:18,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:27:18,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:27:18,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:27:18,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:27:18,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:27:18,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:27:18,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:27:18,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:27:18,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:27:18,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:27:18,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:27:18,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:27:18,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:27:18,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:27:18,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:27:18,698 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:27:18,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:27:18,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:27:18,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:27:18,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:27:18,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:27:18,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:27:18,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:27:18,699 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 -> d402cd14beee6851ca97c58b2a2589220820214ac9c394c1c5bdac6dbc1a1025 [2025-02-05 23:27:18,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:27:18,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:27:18,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:27:18,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:27:18,985 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:27:18,986 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-co_file-81.i [2025-02-05 23:27:20,181 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ea35de1c/2c67cdb737834a41ba6f04d1065c51ee/FLAG3e40711fd [2025-02-05 23:27:20,536 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:27:20,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-02-05 23:27:20,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ea35de1c/2c67cdb737834a41ba6f04d1065c51ee/FLAG3e40711fd [2025-02-05 23:27:20,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ea35de1c/2c67cdb737834a41ba6f04d1065c51ee [2025-02-05 23:27:20,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:27:20,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:27:20,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:27:20,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:27:20,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:27:20,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:27:20" (1/1) ... [2025-02-05 23:27:20,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8177ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:20, skipping insertion in model container [2025-02-05 23:27:20,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:27:20" (1/1) ... [2025-02-05 23:27:20,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:27:20,936 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-co_file-81.i[919,932] [2025-02-05 23:27:21,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:27:21,054 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:27:21,064 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-co_file-81.i[919,932] [2025-02-05 23:27:21,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:27:21,127 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:27:21,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21 WrapperNode [2025-02-05 23:27:21,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:27:21,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:27:21,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:27:21,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:27:21,134 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:27:21" (1/1) ... [2025-02-05 23:27:21,153 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:27:21" (1/1) ... [2025-02-05 23:27:21,193 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 299 [2025-02-05 23:27:21,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:27:21,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:27:21,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:27:21,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:27:21,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,247 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:27:21,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:27:21,282 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:27:21,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:27:21,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:27:21,283 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (1/1) ... [2025-02-05 23:27:21,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:27:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:27:21,315 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:27:21,323 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:27:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:27:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:27:21,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:27:21,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:27:21,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:27:21,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:27:21,441 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:27:21,444 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:27:21,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L220: havoc property_#t~bitwise33#1;havoc property_#t~short34#1; [2025-02-05 23:27:22,041 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 23:27:22,042 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:27:22,064 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:27:22,064 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:27:22,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:27:22 BoogieIcfgContainer [2025-02-05 23:27:22,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:27:22,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:27:22,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:27:22,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:27:22,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:27:20" (1/3) ... [2025-02-05 23:27:22,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641dd813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:27:22, skipping insertion in model container [2025-02-05 23:27:22,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:27:21" (2/3) ... [2025-02-05 23:27:22,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641dd813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:27:22, skipping insertion in model container [2025-02-05 23:27:22,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:27:22" (3/3) ... [2025-02-05 23:27:22,075 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-02-05 23:27:22,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:27:22,094 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:27:22,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:27:22,184 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;@157c31f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:27:22,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:27:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 23:27:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:27:22,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:27:22,209 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:22,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:27:22,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:27:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1509120945, now seen corresponding path program 1 times [2025-02-05 23:27:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:27:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339148558] [2025-02-05 23:27:22,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:27:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:27:22,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:27:22,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:27:22,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:27:22,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:27:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-02-05 23:27:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:27:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339148558] [2025-02-05 23:27:22,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339148558] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:27:22,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120053414] [2025-02-05 23:27:22,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:27:22,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:27:22,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:27:22,648 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:27:22,650 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:27:22,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:27:22,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:27:22,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:27:22,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:27:22,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:27:22,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:27:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-02-05 23:27:22,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:27:22,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120053414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:27:22,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:27:22,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:27:22,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818063641] [2025-02-05 23:27:22,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:27:22,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:27:22,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:27:22,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:27:22,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:27:22,979 INFO L87 Difference]: Start difference. First operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:27:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:27:23,028 INFO L93 Difference]: Finished difference Result 254 states and 459 transitions. [2025-02-05 23:27:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:27:23,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-02-05 23:27:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:27:23,036 INFO L225 Difference]: With dead ends: 254 [2025-02-05 23:27:23,036 INFO L226 Difference]: Without dead ends: 127 [2025-02-05 23:27:23,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 296 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:27:23,041 INFO L435 NwaCegarLoop]: 199 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, 199 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:27:23,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:27:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-05 23:27:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-05 23:27:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 23:27:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 203 transitions. [2025-02-05 23:27:23,102 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 203 transitions. Word has length 295 [2025-02-05 23:27:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:27:23,102 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 203 transitions. [2025-02-05 23:27:23,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:27:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 203 transitions. [2025-02-05 23:27:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:27:23,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:27:23,109 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:23,118 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:27:23,309 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:27:23,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:27:23,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:27:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1634618571, now seen corresponding path program 1 times [2025-02-05 23:27:23,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:27:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14085920] [2025-02-05 23:27:23,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:27:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:27:23,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:27:23,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:27:23,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:27:23,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:27:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:27:27,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:27:27,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14085920] [2025-02-05 23:27:27,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14085920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:27:27,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:27:27,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 23:27:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562821170] [2025-02-05 23:27:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:27:27,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 23:27:27,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:27:27,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 23:27:27,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:27:27,928 INFO L87 Difference]: Start difference. First operand 127 states and 203 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:27:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:27:30,292 INFO L93 Difference]: Finished difference Result 628 states and 1002 transitions. [2025-02-05 23:27:30,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:27:30,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-02-05 23:27:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:27:30,299 INFO L225 Difference]: With dead ends: 628 [2025-02-05 23:27:30,300 INFO L226 Difference]: Without dead ends: 504 [2025-02-05 23:27:30,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-02-05 23:27:30,302 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1237 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:27:30,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 1142 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 23:27:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-02-05 23:27:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 247. [2025-02-05 23:27:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 148 states have (on average 1.3986486486486487) internal successors, (207), 148 states have internal predecessors, (207), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-05 23:27:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 399 transitions. [2025-02-05 23:27:30,377 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 399 transitions. Word has length 295 [2025-02-05 23:27:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:27:30,378 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 399 transitions. [2025-02-05 23:27:30,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:27:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 399 transitions. [2025-02-05 23:27:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:27:30,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:27:30,388 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:30,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:27:30,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:27:30,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:27:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1307039028, now seen corresponding path program 1 times [2025-02-05 23:27:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:27:30,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470716278] [2025-02-05 23:27:30,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:27:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:27:30,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:27:30,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:27:30,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:27:30,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:27:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:27:43,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:27:43,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470716278] [2025-02-05 23:27:43,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470716278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:27:43,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:27:43,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:27:43,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103783364] [2025-02-05 23:27:43,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:27:43,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:27:43,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:27:43,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:27:43,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:27:43,947 INFO L87 Difference]: Start difference. First operand 247 states and 399 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:27:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:27:47,099 INFO L93 Difference]: Finished difference Result 606 states and 973 transitions. [2025-02-05 23:27:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:27:47,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-02-05 23:27:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:27:47,108 INFO L225 Difference]: With dead ends: 606 [2025-02-05 23:27:47,108 INFO L226 Difference]: Without dead ends: 482 [2025-02-05 23:27:47,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-02-05 23:27:47,111 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1013 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:27:47,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1024 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 23:27:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-05 23:27:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 305. [2025-02-05 23:27:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 206 states have (on average 1.4854368932038835) internal successors, (306), 206 states have internal predecessors, (306), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-05 23:27:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 498 transitions. [2025-02-05 23:27:47,178 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 498 transitions. Word has length 295 [2025-02-05 23:27:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:27:47,179 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 498 transitions. [2025-02-05 23:27:47,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:27:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 498 transitions. [2025-02-05 23:27:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:27:47,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:27:47,183 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:47,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:27:47,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:27:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:27:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1812597653, now seen corresponding path program 1 times [2025-02-05 23:27:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:27:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271410488] [2025-02-05 23:27:47,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:27:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:27:47,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:27:47,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:27:47,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:27:47,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:27:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:27:47,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:27:47,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271410488] [2025-02-05 23:27:47,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271410488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:27:47,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:27:47,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:27:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206028294] [2025-02-05 23:27:47,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:27:47,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:27:47,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:27:47,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:27:47,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:27:47,460 INFO L87 Difference]: Start difference. First operand 305 states and 498 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:27:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:27:47,546 INFO L93 Difference]: Finished difference Result 517 states and 835 transitions. [2025-02-05 23:27:47,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:27:47,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-02-05 23:27:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:27:47,552 INFO L225 Difference]: With dead ends: 517 [2025-02-05 23:27:47,552 INFO L226 Difference]: Without dead ends: 380 [2025-02-05 23:27:47,554 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:27:47,556 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 72 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 588 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:27:47,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 588 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:27:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-05 23:27:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2025-02-05 23:27:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 273 states have (on average 1.4945054945054945) internal successors, (408), 274 states have internal predecessors, (408), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:27:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 608 transitions. [2025-02-05 23:27:47,594 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 608 transitions. Word has length 295 [2025-02-05 23:27:47,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:27:47,595 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 608 transitions. [2025-02-05 23:27:47,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:27:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 608 transitions. [2025-02-05 23:27:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:27:47,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:27:47,600 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:47,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:27:47,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:27:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:27:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash 637546218, now seen corresponding path program 1 times [2025-02-05 23:27:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:27:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206633709] [2025-02-05 23:27:47,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:27:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:27:47,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:27:47,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:27:47,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:27:47,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:27:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:27:48,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:27:48,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206633709] [2025-02-05 23:27:48,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206633709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:27:48,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:27:48,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:27:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893225147] [2025-02-05 23:27:48,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:27:48,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:27:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:27:48,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:27:48,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:27:48,603 INFO L87 Difference]: Start difference. First operand 377 states and 608 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:27:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:27:49,833 INFO L93 Difference]: Finished difference Result 802 states and 1282 transitions. [2025-02-05 23:27:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:27:49,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-02-05 23:27:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:27:49,842 INFO L225 Difference]: With dead ends: 802 [2025-02-05 23:27:49,844 INFO L226 Difference]: Without dead ends: 605 [2025-02-05 23:27:49,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:27:49,846 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 641 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:27:49,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1034 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 23:27:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-05 23:27:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 384. [2025-02-05 23:27:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 280 states have (on average 1.4892857142857143) internal successors, (417), 281 states have internal predecessors, (417), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:27:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 617 transitions. [2025-02-05 23:27:49,891 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 617 transitions. Word has length 295 [2025-02-05 23:27:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:27:49,893 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 617 transitions. [2025-02-05 23:27:49,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:27:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 617 transitions. [2025-02-05 23:27:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:27:49,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:27:49,900 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:49,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:27:49,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:27:49,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:27:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1845969484, now seen corresponding path program 1 times [2025-02-05 23:27:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:27:49,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605383243] [2025-02-05 23:27:49,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:27:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:27:49,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:27:50,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:27:50,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:27:50,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:27:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:27:51,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:27:51,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605383243] [2025-02-05 23:27:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605383243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:27:51,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:27:51,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:27:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700307081] [2025-02-05 23:27:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:27:51,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:27:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:27:51,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:27:51,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:27:51,328 INFO L87 Difference]: Start difference. First operand 384 states and 617 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:27:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:27:51,965 INFO L93 Difference]: Finished difference Result 902 states and 1431 transitions. [2025-02-05 23:27:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:27:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-02-05 23:27:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:27:51,970 INFO L225 Difference]: With dead ends: 902 [2025-02-05 23:27:51,970 INFO L226 Difference]: Without dead ends: 727 [2025-02-05 23:27:51,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:27:51,972 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 677 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:27:51,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 871 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:27:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-05 23:27:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 392. [2025-02-05 23:27:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 288 states have (on average 1.4965277777777777) internal successors, (431), 289 states have internal predecessors, (431), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:27:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 631 transitions. [2025-02-05 23:27:52,008 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 631 transitions. Word has length 295 [2025-02-05 23:27:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:27:52,008 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 631 transitions. [2025-02-05 23:27:52,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:27:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 631 transitions. [2025-02-05 23:27:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:27:52,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:27:52,011 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:52,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:27:52,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:27:52,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:27:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1095688115, now seen corresponding path program 1 times [2025-02-05 23:27:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:27:52,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146559710] [2025-02-05 23:27:52,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:27:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:27:52,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:27:52,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:27:52,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:27:52,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:28:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:28:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:28:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146559710] [2025-02-05 23:28:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146559710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:28:01,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:28:01,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:28:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117789110] [2025-02-05 23:28:01,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:28:01,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:28:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:28:01,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:28:01,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:28:01,519 INFO L87 Difference]: Start difference. First operand 392 states and 631 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:28:02,617 INFO L93 Difference]: Finished difference Result 705 states and 1120 transitions. [2025-02-05 23:28:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:28:02,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-02-05 23:28:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:28:02,622 INFO L225 Difference]: With dead ends: 705 [2025-02-05 23:28:02,622 INFO L226 Difference]: Without dead ends: 530 [2025-02-05 23:28:02,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:28:02,624 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 421 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:28:02,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 850 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 23:28:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-02-05 23:28:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 387. [2025-02-05 23:28:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 283 states have (on average 1.4911660777385158) internal successors, (422), 284 states have internal predecessors, (422), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:28:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 622 transitions. [2025-02-05 23:28:02,667 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 622 transitions. Word has length 295 [2025-02-05 23:28:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:28:02,668 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 622 transitions. [2025-02-05 23:28:02,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 622 transitions. [2025-02-05 23:28:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:28:02,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:28:02,671 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:02,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:28:02,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:28:02,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:28:02,671 INFO L85 PathProgramCache]: Analyzing trace with hash 848897131, now seen corresponding path program 1 times [2025-02-05 23:28:02,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:28:02,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032096786] [2025-02-05 23:28:02,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:28:02,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:28:02,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:28:02,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:28:02,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:28:02,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:28:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:28:03,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:28:03,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032096786] [2025-02-05 23:28:03,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032096786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:28:03,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:28:03,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 23:28:03,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786656679] [2025-02-05 23:28:03,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:28:03,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 23:28:03,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:28:03,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 23:28:03,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:28:03,280 INFO L87 Difference]: Start difference. First operand 387 states and 622 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:28:03,857 INFO L93 Difference]: Finished difference Result 777 states and 1244 transitions. [2025-02-05 23:28:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:28:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-02-05 23:28:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:28:03,864 INFO L225 Difference]: With dead ends: 777 [2025-02-05 23:28:03,864 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 23:28:03,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:28:03,866 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 343 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:28:03,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 800 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:28:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 23:28:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 388. [2025-02-05 23:28:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 284 states have (on average 1.4929577464788732) internal successors, (424), 285 states have internal predecessors, (424), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:28:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 624 transitions. [2025-02-05 23:28:03,927 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 624 transitions. Word has length 295 [2025-02-05 23:28:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:28:03,927 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 624 transitions. [2025-02-05 23:28:03,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 624 transitions. [2025-02-05 23:28:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 23:28:03,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:28:03,930 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:03,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:28:03,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:28:03,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:28:03,931 INFO L85 PathProgramCache]: Analyzing trace with hash -890085896, now seen corresponding path program 1 times [2025-02-05 23:28:03,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:28:03,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598473647] [2025-02-05 23:28:03,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:28:03,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:28:03,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 23:28:03,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 23:28:03,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:28:03,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:28:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:28:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:28:04,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598473647] [2025-02-05 23:28:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598473647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:28:04,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:28:04,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:28:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929951001] [2025-02-05 23:28:04,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:28:04,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:28:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:28:04,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:28:04,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:28:04,873 INFO L87 Difference]: Start difference. First operand 388 states and 624 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:28:06,158 INFO L93 Difference]: Finished difference Result 800 states and 1266 transitions. [2025-02-05 23:28:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:28:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-02-05 23:28:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:28:06,165 INFO L225 Difference]: With dead ends: 800 [2025-02-05 23:28:06,166 INFO L226 Difference]: Without dead ends: 603 [2025-02-05 23:28:06,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:28:06,168 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 297 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:28:06,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1067 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 23:28:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-02-05 23:28:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 373. [2025-02-05 23:28:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 269 states have (on average 1.479553903345725) internal successors, (398), 270 states have internal predecessors, (398), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:28:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 598 transitions. [2025-02-05 23:28:06,212 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 598 transitions. Word has length 296 [2025-02-05 23:28:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:28:06,213 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 598 transitions. [2025-02-05 23:28:06,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 598 transitions. [2025-02-05 23:28:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 23:28:06,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:28:06,215 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:06,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:28:06,215 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:28:06,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:28:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1886654682, now seen corresponding path program 1 times [2025-02-05 23:28:06,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:28:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304034662] [2025-02-05 23:28:06,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:28:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:28:06,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 23:28:06,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 23:28:06,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:28:06,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:28:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:28:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:28:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304034662] [2025-02-05 23:28:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304034662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:28:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:28:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 23:28:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715788030] [2025-02-05 23:28:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:28:13,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:28:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:28:13,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:28:13,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:28:13,072 INFO L87 Difference]: Start difference. First operand 373 states and 598 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:28:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:28:17,069 INFO L93 Difference]: Finished difference Result 839 states and 1316 transitions. [2025-02-05 23:28:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 23:28:17,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 296 [2025-02-05 23:28:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:28:17,073 INFO L225 Difference]: With dead ends: 839 [2025-02-05 23:28:17,073 INFO L226 Difference]: Without dead ends: 664 [2025-02-05 23:28:17,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2025-02-05 23:28:17,075 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1009 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:28:17,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1053 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 23:28:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-02-05 23:28:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 393. [2025-02-05 23:28:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 289 states have (on average 1.5017301038062283) internal successors, (434), 290 states have internal predecessors, (434), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:28:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 634 transitions. [2025-02-05 23:28:17,115 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 634 transitions. Word has length 296 [2025-02-05 23:28:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:28:17,115 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 634 transitions. [2025-02-05 23:28:17,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:28:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 634 transitions. [2025-02-05 23:28:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 23:28:17,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:28:17,118 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:17,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 23:28:17,118 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:28:17,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:28:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1381096057, now seen corresponding path program 1 times [2025-02-05 23:28:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:28:17,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556325151] [2025-02-05 23:28:17,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:28:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:28:17,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 23:28:17,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 23:28:17,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:28:17,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:28:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:28:22,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:28:22,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556325151] [2025-02-05 23:28:22,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556325151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:28:22,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:28:22,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:28:22,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970790752] [2025-02-05 23:28:22,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:28:22,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:28:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:28:22,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:28:22,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:28:22,460 INFO L87 Difference]: Start difference. First operand 393 states and 634 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:28:24,116 INFO L93 Difference]: Finished difference Result 770 states and 1218 transitions. [2025-02-05 23:28:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:28:24,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-02-05 23:28:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:28:24,120 INFO L225 Difference]: With dead ends: 770 [2025-02-05 23:28:24,121 INFO L226 Difference]: Without dead ends: 595 [2025-02-05 23:28:24,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-02-05 23:28:24,123 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 546 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:28:24,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1184 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:28:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-05 23:28:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 424. [2025-02-05 23:28:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 320 states have (on average 1.50625) internal successors, (482), 321 states have internal predecessors, (482), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:28:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 682 transitions. [2025-02-05 23:28:24,166 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 682 transitions. Word has length 296 [2025-02-05 23:28:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:28:24,167 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 682 transitions. [2025-02-05 23:28:24,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 682 transitions. [2025-02-05 23:28:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 23:28:24,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:28:24,169 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:24,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:28:24,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:28:24,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:28:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2098005595, now seen corresponding path program 1 times [2025-02-05 23:28:24,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:28:24,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036092444] [2025-02-05 23:28:24,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:28:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:28:24,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 23:28:24,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 23:28:24,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:28:24,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:28:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:28:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:28:29,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036092444] [2025-02-05 23:28:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036092444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:28:29,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:28:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:28:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64577984] [2025-02-05 23:28:29,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:28:29,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:28:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:28:29,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:28:29,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:28:29,884 INFO L87 Difference]: Start difference. First operand 424 states and 682 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:28:31,452 INFO L93 Difference]: Finished difference Result 730 states and 1158 transitions. [2025-02-05 23:28:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:28:31,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-02-05 23:28:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:28:31,457 INFO L225 Difference]: With dead ends: 730 [2025-02-05 23:28:31,457 INFO L226 Difference]: Without dead ends: 555 [2025-02-05 23:28:31,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-02-05 23:28:31,459 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 399 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:28:31,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 934 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 23:28:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-05 23:28:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 421. [2025-02-05 23:28:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 317 states have (on average 1.5110410094637223) internal successors, (479), 318 states have internal predecessors, (479), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:28:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 679 transitions. [2025-02-05 23:28:31,503 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 679 transitions. Word has length 296 [2025-02-05 23:28:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:28:31,505 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 679 transitions. [2025-02-05 23:28:31,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 679 transitions. [2025-02-05 23:28:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 23:28:31,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:28:31,507 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:31,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 23:28:31,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:28:31,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:28:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1592446970, now seen corresponding path program 1 times [2025-02-05 23:28:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:28:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659345360] [2025-02-05 23:28:31,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:28:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:28:31,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 23:28:31,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 23:28:31,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:28:31,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:28:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:28:32,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:28:32,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659345360] [2025-02-05 23:28:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659345360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:28:32,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:28:32,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 23:28:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472434030] [2025-02-05 23:28:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:28:32,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 23:28:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:28:32,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 23:28:32,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:28:32,283 INFO L87 Difference]: Start difference. First operand 421 states and 679 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:28:33,098 INFO L93 Difference]: Finished difference Result 714 states and 1134 transitions. [2025-02-05 23:28:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:28:33,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-02-05 23:28:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:28:33,101 INFO L225 Difference]: With dead ends: 714 [2025-02-05 23:28:33,101 INFO L226 Difference]: Without dead ends: 526 [2025-02-05 23:28:33,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:28:33,103 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 446 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:28:33,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 845 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:28:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-05 23:28:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 402. [2025-02-05 23:28:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 298 states have (on average 1.4966442953020134) internal successors, (446), 299 states have internal predecessors, (446), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:28:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 646 transitions. [2025-02-05 23:28:33,147 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 646 transitions. Word has length 296 [2025-02-05 23:28:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:28:33,148 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 646 transitions. [2025-02-05 23:28:33,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 646 transitions. [2025-02-05 23:28:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 23:28:33,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:28:33,150 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:33,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 23:28:33,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:28:33,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:28:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash 466338232, now seen corresponding path program 1 times [2025-02-05 23:28:33,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:28:33,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876017790] [2025-02-05 23:28:33,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:28:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:28:33,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 23:28:33,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 23:28:33,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:28:33,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:28:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:28:33,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:28:33,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876017790] [2025-02-05 23:28:33,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876017790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:28:33,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:28:33,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:28:33,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048146606] [2025-02-05 23:28:33,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:28:33,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:28:33,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:28:33,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:28:33,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:28:33,386 INFO L87 Difference]: Start difference. First operand 402 states and 646 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, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:28:33,460 INFO L93 Difference]: Finished difference Result 661 states and 1055 transitions. [2025-02-05 23:28:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:28:33,460 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, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-02-05 23:28:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:28:33,464 INFO L225 Difference]: With dead ends: 661 [2025-02-05 23:28:33,464 INFO L226 Difference]: Without dead ends: 480 [2025-02-05 23:28:33,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:28:33,466 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 126 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:28:33,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 659 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:28:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-02-05 23:28:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 395. [2025-02-05 23:28:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 294 states have internal predecessors, (445), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-05 23:28:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 637 transitions. [2025-02-05 23:28:33,507 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 637 transitions. Word has length 296 [2025-02-05 23:28:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:28:33,507 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 637 transitions. [2025-02-05 23:28:33,508 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, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:28:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 637 transitions. [2025-02-05 23:28:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 23:28:33,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:28:33,510 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:33,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 23:28:33,510 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:28:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:28:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -39220393, now seen corresponding path program 1 times [2025-02-05 23:28:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:28:33,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614690746] [2025-02-05 23:28:33,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:28:33,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:28:33,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 23:28:33,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 23:28:33,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:28:33,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:28:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:28:34,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:28:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614690746] [2025-02-05 23:28:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614690746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:28:34,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:28:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:28:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374234923] [2025-02-05 23:28:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:28:34,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:28:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:28:34,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:28:34,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:28:34,857 INFO L87 Difference]: Start difference. First operand 395 states and 637 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48)