./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bce8a1c6d77e62a944a85cff651afbec2f58c05a59aa99727e257a59bda2e393 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:44:34,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:44:34,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:44:34,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:44:34,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:44:34,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:44:34,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:44:34,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:44:34,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:44:34,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:44:34,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:44:34,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:44:34,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:44:34,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:44:34,202 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:44:34,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:44:34,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:44:34,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:44:34,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:44:34,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:44:34,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:44:34,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:44:34,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:44:34,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:44:34,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:44:34,204 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:44:34,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:44:34,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:44:34,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:44:34,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:44:34,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:44:34,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:44:34,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:44:34,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bce8a1c6d77e62a944a85cff651afbec2f58c05a59aa99727e257a59bda2e393 [2025-03-08 15:44:34,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:44:34,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:44:34,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:44:34,527 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:44:34,528 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:44:34,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-47.i [2025-03-08 15:44:35,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7652e78d4/e86d5d206ab84a968d9264ce51b3019b/FLAGc10b2e2e8 [2025-03-08 15:44:35,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:44:35,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-47.i [2025-03-08 15:44:35,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7652e78d4/e86d5d206ab84a968d9264ce51b3019b/FLAGc10b2e2e8 [2025-03-08 15:44:36,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7652e78d4/e86d5d206ab84a968d9264ce51b3019b [2025-03-08 15:44:36,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:44:36,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:44:36,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:44:36,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:44:36,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:44:36,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53da7ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36, skipping insertion in model container [2025-03-08 15:44:36,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:44:36,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-47.i[916,929] [2025-03-08 15:44:36,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:44:36,495 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:44:36,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-47.i[916,929] [2025-03-08 15:44:36,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:44:36,595 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:44:36,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36 WrapperNode [2025-03-08 15:44:36,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:44:36,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:44:36,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:44:36,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:44:36,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,680 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 694 [2025-03-08 15:44:36,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:44:36,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:44:36,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:44:36,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:44:36,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,777 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:44:36,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:44:36,841 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:44:36,841 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:44:36,841 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:44:36,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (1/1) ... [2025-03-08 15:44:36,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:44:36,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:36,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:44:36,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:44:36,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:44:36,890 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:44:36,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:44:36,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:44:36,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:44:36,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:44:37,007 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:44:37,008 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:44:37,863 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: havoc property_#t~ite46#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short47#1;havoc property_#t~bitwise48#1;havoc property_#t~short49#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short52#1;havoc property_#t~ite54#1;havoc property_#t~bitwise53#1;havoc property_#t~short55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1; [2025-03-08 15:44:37,993 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-08 15:44:37,994 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:44:38,019 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:44:38,021 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:44:38,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:44:38 BoogieIcfgContainer [2025-03-08 15:44:38,021 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:44:38,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:44:38,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:44:38,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:44:38,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:44:36" (1/3) ... [2025-03-08 15:44:38,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65599650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:44:38, skipping insertion in model container [2025-03-08 15:44:38,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:36" (2/3) ... [2025-03-08 15:44:38,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65599650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:44:38, skipping insertion in model container [2025-03-08 15:44:38,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:44:38" (3/3) ... [2025-03-08 15:44:38,029 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-47.i [2025-03-08 15:44:38,039 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:44:38,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-47.i that has 2 procedures, 270 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:44:38,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:44:38,101 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;@66621468, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:44:38,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:44:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 270 states, 207 states have (on average 1.5603864734299517) internal successors, (323), 208 states have internal predecessors, (323), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 15:44:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 15:44:38,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:38,128 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:38,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:38,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2128764271, now seen corresponding path program 1 times [2025-03-08 15:44:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362962049] [2025-03-08 15:44:38,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:38,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 15:44:38,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 15:44:38,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:38,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-03-08 15:44:38,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:38,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362962049] [2025-03-08 15:44:38,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362962049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:44:38,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539783096] [2025-03-08 15:44:38,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:38,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:38,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:38,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:44:38,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:44:38,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 15:44:39,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 15:44:39,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:39,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:39,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:44:39,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:44:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-03-08 15:44:39,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:44:39,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539783096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:39,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:44:39,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:44:39,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309957965] [2025-03-08 15:44:39,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:39,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:44:39,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:39,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:44:39,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:44:39,117 INFO L87 Difference]: Start difference. First operand has 270 states, 207 states have (on average 1.5603864734299517) internal successors, (323), 208 states have internal predecessors, (323), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:44:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:39,177 INFO L93 Difference]: Finished difference Result 534 states and 941 transitions. [2025-03-08 15:44:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:44:39,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 428 [2025-03-08 15:44:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:39,185 INFO L225 Difference]: With dead ends: 534 [2025-03-08 15:44:39,185 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 15:44:39,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:44:39,190 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:39,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:44:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 15:44:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-08 15:44:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 205 states have (on average 1.5414634146341464) internal successors, (316), 205 states have internal predecessors, (316), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 15:44:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 436 transitions. [2025-03-08 15:44:39,252 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 436 transitions. Word has length 428 [2025-03-08 15:44:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:39,254 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 436 transitions. [2025-03-08 15:44:39,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:44:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 436 transitions. [2025-03-08 15:44:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 15:44:39,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:39,265 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:39,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:44:39,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:44:39,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:39,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash -3594189, now seen corresponding path program 1 times [2025-03-08 15:44:39,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:39,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138469016] [2025-03-08 15:44:39,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:39,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 15:44:39,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 15:44:39,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:39,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:44:39,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:39,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138469016] [2025-03-08 15:44:39,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138469016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:39,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:39,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738358655] [2025-03-08 15:44:39,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:39,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:39,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:39,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:39,923 INFO L87 Difference]: Start difference. First operand 267 states and 436 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:40,038 INFO L93 Difference]: Finished difference Result 792 states and 1296 transitions. [2025-03-08 15:44:40,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:40,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 428 [2025-03-08 15:44:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:40,045 INFO L225 Difference]: With dead ends: 792 [2025-03-08 15:44:40,045 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 15:44:40,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:40,047 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 369 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:40,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1103 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 15:44:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 350. [2025-03-08 15:44:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 288 states have (on average 1.59375) internal successors, (459), 288 states have internal predecessors, (459), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 15:44:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 579 transitions. [2025-03-08 15:44:40,088 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 579 transitions. Word has length 428 [2025-03-08 15:44:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:40,091 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 579 transitions. [2025-03-08 15:44:40,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 579 transitions. [2025-03-08 15:44:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 15:44:40,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:40,097 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:40,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:44:40,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:40,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash -454725549, now seen corresponding path program 1 times [2025-03-08 15:44:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:40,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026701803] [2025-03-08 15:44:40,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:40,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:40,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 15:44:40,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 15:44:40,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:40,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:44:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:40,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026701803] [2025-03-08 15:44:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026701803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:40,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093238640] [2025-03-08 15:44:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:40,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:40,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:40,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:40,864 INFO L87 Difference]: Start difference. First operand 350 states and 579 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:41,115 INFO L93 Difference]: Finished difference Result 1045 states and 1732 transitions. [2025-03-08 15:44:41,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:41,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 428 [2025-03-08 15:44:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:41,119 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 15:44:41,120 INFO L226 Difference]: Without dead ends: 698 [2025-03-08 15:44:41,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:41,121 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 356 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:41,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1258 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-08 15:44:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 458. [2025-03-08 15:44:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 335 states have (on average 1.519402985074627) internal successors, (509), 335 states have internal predecessors, (509), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:44:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 749 transitions. [2025-03-08 15:44:41,158 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 749 transitions. Word has length 428 [2025-03-08 15:44:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:41,159 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 749 transitions. [2025-03-08 15:44:41,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 749 transitions. [2025-03-08 15:44:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 15:44:41,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:41,163 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:41,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:44:41,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:41,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:41,164 INFO L85 PathProgramCache]: Analyzing trace with hash -731862925, now seen corresponding path program 1 times [2025-03-08 15:44:41,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012095340] [2025-03-08 15:44:41,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:41,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 15:44:41,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 15:44:41,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:41,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:44:43,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012095340] [2025-03-08 15:44:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012095340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:43,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:43,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805114919] [2025-03-08 15:44:43,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:43,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:43,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:43,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:43,205 INFO L87 Difference]: Start difference. First operand 458 states and 749 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:43,465 INFO L93 Difference]: Finished difference Result 1190 states and 1971 transitions. [2025-03-08 15:44:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 428 [2025-03-08 15:44:43,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:43,470 INFO L225 Difference]: With dead ends: 1190 [2025-03-08 15:44:43,470 INFO L226 Difference]: Without dead ends: 843 [2025-03-08 15:44:43,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:43,472 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 594 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:43,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1489 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-08 15:44:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 498. [2025-03-08 15:44:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 375 states have (on average 1.5386666666666666) internal successors, (577), 375 states have internal predecessors, (577), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:44:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 817 transitions. [2025-03-08 15:44:43,520 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 817 transitions. Word has length 428 [2025-03-08 15:44:43,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:43,521 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 817 transitions. [2025-03-08 15:44:43,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 817 transitions. [2025-03-08 15:44:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 15:44:43,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:43,526 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:43,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:44:43,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:43,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash 572530804, now seen corresponding path program 1 times [2025-03-08 15:44:43,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:43,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806367495] [2025-03-08 15:44:43,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:43,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 15:44:43,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 15:44:43,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:43,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:44:44,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806367495] [2025-03-08 15:44:44,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806367495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:44,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:44,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:44,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303482508] [2025-03-08 15:44:44,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:44,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:44,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:44,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:44,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:44,363 INFO L87 Difference]: Start difference. First operand 498 states and 817 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:44,634 INFO L93 Difference]: Finished difference Result 1125 states and 1867 transitions. [2025-03-08 15:44:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:44,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 428 [2025-03-08 15:44:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:44,640 INFO L225 Difference]: With dead ends: 1125 [2025-03-08 15:44:44,640 INFO L226 Difference]: Without dead ends: 738 [2025-03-08 15:44:44,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:44:44,641 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 386 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:44,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1672 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-08 15:44:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 503. [2025-03-08 15:44:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 380 states have (on average 1.5394736842105263) internal successors, (585), 380 states have internal predecessors, (585), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:44:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 825 transitions. [2025-03-08 15:44:44,695 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 825 transitions. Word has length 428 [2025-03-08 15:44:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:44,697 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 825 transitions. [2025-03-08 15:44:44,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 825 transitions. [2025-03-08 15:44:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 15:44:44,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:44,704 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:44,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:44:44,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:44,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:44,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1260781964, now seen corresponding path program 1 times [2025-03-08 15:44:44,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:44,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960624026] [2025-03-08 15:44:44,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:44,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:44,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 15:44:44,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 15:44:44,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:44,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:44:45,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:45,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960624026] [2025-03-08 15:44:45,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960624026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:45,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:45,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:45,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237963249] [2025-03-08 15:44:45,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:45,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:45,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:45,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:45,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:45,628 INFO L87 Difference]: Start difference. First operand 503 states and 825 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:45,826 INFO L93 Difference]: Finished difference Result 1254 states and 2078 transitions. [2025-03-08 15:44:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:45,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 428 [2025-03-08 15:44:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:45,831 INFO L225 Difference]: With dead ends: 1254 [2025-03-08 15:44:45,831 INFO L226 Difference]: Without dead ends: 867 [2025-03-08 15:44:45,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:45,833 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 548 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:45,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1139 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-08 15:44:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 632. [2025-03-08 15:44:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 509 states have (on average 1.587426326129666) internal successors, (808), 509 states have internal predecessors, (808), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:44:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1048 transitions. [2025-03-08 15:44:45,873 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1048 transitions. Word has length 428 [2025-03-08 15:44:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:45,873 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 1048 transitions. [2025-03-08 15:44:45,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1048 transitions. [2025-03-08 15:44:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 15:44:45,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:45,878 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:45,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:44:45,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:45,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash 956975989, now seen corresponding path program 1 times [2025-03-08 15:44:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:45,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634038489] [2025-03-08 15:44:45,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:45,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 15:44:46,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 15:44:46,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:46,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:44:47,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:47,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634038489] [2025-03-08 15:44:47,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634038489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:47,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:47,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:47,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258901548] [2025-03-08 15:44:47,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:47,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:47,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:47,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:47,280 INFO L87 Difference]: Start difference. First operand 632 states and 1048 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:47,454 INFO L93 Difference]: Finished difference Result 1457 states and 2429 transitions. [2025-03-08 15:44:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 428 [2025-03-08 15:44:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:47,462 INFO L225 Difference]: With dead ends: 1457 [2025-03-08 15:44:47,463 INFO L226 Difference]: Without dead ends: 941 [2025-03-08 15:44:47,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:47,465 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 275 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:47,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1818 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-08 15:44:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 938. [2025-03-08 15:44:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 779 states have (on average 1.600770218228498) internal successors, (1247), 780 states have internal predecessors, (1247), 155 states have call successors, (155), 3 states have call predecessors, (155), 3 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-08 15:44:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1557 transitions. [2025-03-08 15:44:47,525 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1557 transitions. Word has length 428 [2025-03-08 15:44:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:47,526 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1557 transitions. [2025-03-08 15:44:47,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1557 transitions. [2025-03-08 15:44:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 15:44:47,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:47,531 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:47,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:44:47,531 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:47,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2033597578, now seen corresponding path program 1 times [2025-03-08 15:44:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:47,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497350208] [2025-03-08 15:44:47,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:47,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 15:44:47,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 15:44:47,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:47,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:44:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497350208] [2025-03-08 15:44:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497350208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:48,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:48,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538219842] [2025-03-08 15:44:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:48,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:48,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:48,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:48,813 INFO L87 Difference]: Start difference. First operand 938 states and 1557 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:49,339 INFO L93 Difference]: Finished difference Result 2877 states and 4806 transitions. [2025-03-08 15:44:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:49,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 428 [2025-03-08 15:44:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:49,350 INFO L225 Difference]: With dead ends: 2877 [2025-03-08 15:44:49,351 INFO L226 Difference]: Without dead ends: 2055 [2025-03-08 15:44:49,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:49,354 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 843 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:49,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1261 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:44:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2025-03-08 15:44:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 844. [2025-03-08 15:44:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 719 states have (on average 1.6216968011126565) internal successors, (1166), 719 states have internal predecessors, (1166), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:44:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1406 transitions. [2025-03-08 15:44:49,413 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1406 transitions. Word has length 428 [2025-03-08 15:44:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:49,413 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1406 transitions. [2025-03-08 15:44:49,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1406 transitions. [2025-03-08 15:44:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:44:49,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:49,420 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:49,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:44:49,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:49,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash -574574597, now seen corresponding path program 1 times [2025-03-08 15:44:49,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:49,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254322575] [2025-03-08 15:44:49,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:49,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:44:49,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:44:49,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:49,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:44:50,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:50,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254322575] [2025-03-08 15:44:50,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254322575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:50,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:50,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:44:50,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959122222] [2025-03-08 15:44:50,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:50,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:44:50,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:50,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:44:50,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:50,731 INFO L87 Difference]: Start difference. First operand 844 states and 1406 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:51,284 INFO L93 Difference]: Finished difference Result 2610 states and 4394 transitions. [2025-03-08 15:44:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:44:51,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 429 [2025-03-08 15:44:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:51,292 INFO L225 Difference]: With dead ends: 2610 [2025-03-08 15:44:51,293 INFO L226 Difference]: Without dead ends: 1886 [2025-03-08 15:44:51,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:44:51,295 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 865 mSDsluCounter, 2477 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:51,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 3162 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:44:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2025-03-08 15:44:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 937. [2025-03-08 15:44:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 812 states have (on average 1.6317733990147782) internal successors, (1325), 812 states have internal predecessors, (1325), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:44:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1565 transitions. [2025-03-08 15:44:51,353 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1565 transitions. Word has length 429 [2025-03-08 15:44:51,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:51,354 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1565 transitions. [2025-03-08 15:44:51,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1565 transitions. [2025-03-08 15:44:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:44:51,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:51,358 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:51,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:44:51,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:51,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash 149546907, now seen corresponding path program 1 times [2025-03-08 15:44:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845713206] [2025-03-08 15:44:51,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:51,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:44:51,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:44:51,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:51,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:44:54,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:54,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845713206] [2025-03-08 15:44:54,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845713206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:54,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:54,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:44:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263625291] [2025-03-08 15:44:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:54,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:44:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:54,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:44:54,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:44:54,663 INFO L87 Difference]: Start difference. First operand 937 states and 1565 transitions. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:57,048 INFO L93 Difference]: Finished difference Result 4105 states and 6911 transitions. [2025-03-08 15:44:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:44:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 429 [2025-03-08 15:44:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:57,061 INFO L225 Difference]: With dead ends: 4105 [2025-03-08 15:44:57,062 INFO L226 Difference]: Without dead ends: 3288 [2025-03-08 15:44:57,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:44:57,065 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 2480 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2480 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:57,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2480 Valid, 3133 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 15:44:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-03-08 15:44:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 1540. [2025-03-08 15:44:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1412 states have (on average 1.6543909348441925) internal successors, (2336), 1413 states have internal predecessors, (2336), 122 states have call successors, (122), 5 states have call predecessors, (122), 5 states have return successors, (122), 121 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-08 15:44:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2580 transitions. [2025-03-08 15:44:57,142 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2580 transitions. Word has length 429 [2025-03-08 15:44:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:57,143 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2580 transitions. [2025-03-08 15:44:57,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:44:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2580 transitions. [2025-03-08 15:44:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:44:57,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:57,148 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:57,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:44:57,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:57,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1640850948, now seen corresponding path program 1 times [2025-03-08 15:44:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:57,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357937837] [2025-03-08 15:44:57,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:57,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:57,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:44:57,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:44:57,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:57,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:45:00,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:00,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357937837] [2025-03-08 15:45:00,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357937837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:00,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:00,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:45:00,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497717930] [2025-03-08 15:45:00,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:00,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:45:00,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:00,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:45:00,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:45:00,319 INFO L87 Difference]: Start difference. First operand 1540 states and 2580 transitions. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:01,752 INFO L93 Difference]: Finished difference Result 4057 states and 6844 transitions. [2025-03-08 15:45:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:45:01,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 429 [2025-03-08 15:45:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:01,764 INFO L225 Difference]: With dead ends: 4057 [2025-03-08 15:45:01,764 INFO L226 Difference]: Without dead ends: 3178 [2025-03-08 15:45:01,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:45:01,768 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 1879 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:01,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1879 Valid, 2920 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:45:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2025-03-08 15:45:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 1478. [2025-03-08 15:45:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1353 states have (on average 1.6629711751662972) internal successors, (2250), 1353 states have internal predecessors, (2250), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:45:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2490 transitions. [2025-03-08 15:45:01,861 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2490 transitions. Word has length 429 [2025-03-08 15:45:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:01,862 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 2490 transitions. [2025-03-08 15:45:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2490 transitions. [2025-03-08 15:45:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:45:01,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:01,870 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:01,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:45:01,871 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:01,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash -235819876, now seen corresponding path program 1 times [2025-03-08 15:45:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:01,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947801311] [2025-03-08 15:45:01,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:01,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:45:02,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:45:02,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:02,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:45:02,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:02,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947801311] [2025-03-08 15:45:02,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947801311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:02,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:02,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:45:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854688807] [2025-03-08 15:45:02,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:02,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:45:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:02,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:45:02,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:45:02,939 INFO L87 Difference]: Start difference. First operand 1478 states and 2490 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:03,804 INFO L93 Difference]: Finished difference Result 3227 states and 5411 transitions. [2025-03-08 15:45:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:45:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 429 [2025-03-08 15:45:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:03,814 INFO L225 Difference]: With dead ends: 3227 [2025-03-08 15:45:03,814 INFO L226 Difference]: Without dead ends: 2410 [2025-03-08 15:45:03,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:45:03,817 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 601 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:03,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 2400 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:45:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2025-03-08 15:45:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2360. [2025-03-08 15:45:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2169 states have (on average 1.6602120792992163) internal successors, (3601), 2170 states have internal predecessors, (3601), 182 states have call successors, (182), 8 states have call predecessors, (182), 8 states have return successors, (182), 181 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-08 15:45:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3965 transitions. [2025-03-08 15:45:03,893 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3965 transitions. Word has length 429 [2025-03-08 15:45:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:03,894 INFO L471 AbstractCegarLoop]: Abstraction has 2360 states and 3965 transitions. [2025-03-08 15:45:03,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3965 transitions. [2025-03-08 15:45:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:45:03,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:03,898 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:03,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:45:03,898 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:03,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2026217731, now seen corresponding path program 1 times [2025-03-08 15:45:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:03,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104138975] [2025-03-08 15:45:03,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:03,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:03,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:45:04,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:45:04,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:04,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:45:04,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:04,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104138975] [2025-03-08 15:45:04,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104138975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:04,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:04,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:04,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393716609] [2025-03-08 15:45:04,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:04,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:04,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:04,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:04,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:04,817 INFO L87 Difference]: Start difference. First operand 2360 states and 3965 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:05,074 INFO L93 Difference]: Finished difference Result 6545 states and 11042 transitions. [2025-03-08 15:45:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:45:05,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 429 [2025-03-08 15:45:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:05,095 INFO L225 Difference]: With dead ends: 6545 [2025-03-08 15:45:05,096 INFO L226 Difference]: Without dead ends: 4389 [2025-03-08 15:45:05,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:05,102 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 871 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:05,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2146 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:45:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4389 states. [2025-03-08 15:45:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4389 to 4004. [2025-03-08 15:45:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 3777 states have (on average 1.6666666666666667) internal successors, (6295), 3779 states have internal predecessors, (6295), 215 states have call successors, (215), 11 states have call predecessors, (215), 11 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2025-03-08 15:45:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 6725 transitions. [2025-03-08 15:45:05,226 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 6725 transitions. Word has length 429 [2025-03-08 15:45:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:05,226 INFO L471 AbstractCegarLoop]: Abstraction has 4004 states and 6725 transitions. [2025-03-08 15:45:05,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 6725 transitions. [2025-03-08 15:45:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:45:05,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:05,238 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:05,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:45:05,238 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:05,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1280687139, now seen corresponding path program 1 times [2025-03-08 15:45:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:05,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63820649] [2025-03-08 15:45:05,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:05,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:45:05,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:45:05,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:05,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:45:05,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63820649] [2025-03-08 15:45:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63820649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:05,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:05,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984321209] [2025-03-08 15:45:05,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:05,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:05,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:05,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:05,952 INFO L87 Difference]: Start difference. First operand 4004 states and 6725 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:06,141 INFO L93 Difference]: Finished difference Result 6952 states and 11668 transitions. [2025-03-08 15:45:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:45:06,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 429 [2025-03-08 15:45:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:06,166 INFO L225 Difference]: With dead ends: 6952 [2025-03-08 15:45:06,166 INFO L226 Difference]: Without dead ends: 4007 [2025-03-08 15:45:06,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:06,172 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 298 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:06,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1600 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4007 states. [2025-03-08 15:45:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4007 to 4004. [2025-03-08 15:45:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 3777 states have (on average 1.6629600211808313) internal successors, (6281), 3779 states have internal predecessors, (6281), 215 states have call successors, (215), 11 states have call predecessors, (215), 11 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2025-03-08 15:45:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 6711 transitions. [2025-03-08 15:45:06,331 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 6711 transitions. Word has length 429 [2025-03-08 15:45:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:06,331 INFO L471 AbstractCegarLoop]: Abstraction has 4004 states and 6711 transitions. [2025-03-08 15:45:06,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 6711 transitions. [2025-03-08 15:45:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:45:06,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:06,340 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:06,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:45:06,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:06,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:06,342 INFO L85 PathProgramCache]: Analyzing trace with hash -319073122, now seen corresponding path program 1 times [2025-03-08 15:45:06,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:06,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728121843] [2025-03-08 15:45:06,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:06,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:06,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:45:06,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:45:06,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:06,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:45:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728121843] [2025-03-08 15:45:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728121843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:45:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230718713] [2025-03-08 15:45:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:07,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:45:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:07,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:45:07,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:45:07,720 INFO L87 Difference]: Start difference. First operand 4004 states and 6711 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:09,071 INFO L93 Difference]: Finished difference Result 9460 states and 15714 transitions. [2025-03-08 15:45:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 15:45:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 429 [2025-03-08 15:45:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:09,086 INFO L225 Difference]: With dead ends: 9460 [2025-03-08 15:45:09,086 INFO L226 Difference]: Without dead ends: 6515 [2025-03-08 15:45:09,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:45:09,092 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 2892 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2892 SdHoareTripleChecker+Valid, 3437 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:09,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2892 Valid, 3437 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:45:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6515 states. [2025-03-08 15:45:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6515 to 6129. [2025-03-08 15:45:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6129 states, 5836 states have (on average 1.660212474297464) internal successors, (9689), 5839 states have internal predecessors, (9689), 277 states have call successors, (277), 15 states have call predecessors, (277), 15 states have return successors, (277), 274 states have call predecessors, (277), 277 states have call successors, (277) [2025-03-08 15:45:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 10243 transitions. [2025-03-08 15:45:09,271 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 10243 transitions. Word has length 429 [2025-03-08 15:45:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:09,271 INFO L471 AbstractCegarLoop]: Abstraction has 6129 states and 10243 transitions. [2025-03-08 15:45:09,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:45:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 10243 transitions. [2025-03-08 15:45:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-08 15:45:09,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:09,281 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:09,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:45:09,281 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:09,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash 312907614, now seen corresponding path program 1 times [2025-03-08 15:45:09,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:09,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509968874] [2025-03-08 15:45:09,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:09,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:09,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-08 15:45:10,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-08 15:45:10,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:10,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat