./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-41.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 d5e62ad5739342cd7c449104f0191747734ea5d5507ad0897461505e92cf32f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:32:38,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:32:39,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:32:39,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:32:39,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:32:39,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:32:39,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:32:39,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:32:39,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:32:39,033 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:32:39,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:32:39,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:32:39,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:32:39,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:32:39,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:32:39,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:32:39,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:32:39,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:32:39,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:32:39,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:32:39,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:32:39,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:32:39,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:32:39,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:32:39,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:32:39,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:32:39,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:32:39,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:32:39,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:32:39,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:32:39,036 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 -> d5e62ad5739342cd7c449104f0191747734ea5d5507ad0897461505e92cf32f4 [2025-03-04 00:32:39,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:32:39,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:32:39,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:32:39,255 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:32:39,255 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:32:39,256 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-41.i [2025-03-04 00:32:40,367 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3311fd2e/2537d1ff5c0a4c2ebafdb8f4a19c542a/FLAG77b662a06 [2025-03-04 00:32:40,685 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:32:40,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-41.i [2025-03-04 00:32:40,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3311fd2e/2537d1ff5c0a4c2ebafdb8f4a19c542a/FLAG77b662a06 [2025-03-04 00:32:40,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3311fd2e/2537d1ff5c0a4c2ebafdb8f4a19c542a [2025-03-04 00:32:40,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:32:40,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:32:40,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:32:40,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:32:40,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:32:40,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:32:40" (1/1) ... [2025-03-04 00:32:40,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ef471a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:40, skipping insertion in model container [2025-03-04 00:32:40,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:32:40" (1/1) ... [2025-03-04 00:32:40,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:32:41,088 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-41.i[916,929] [2025-03-04 00:32:41,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:32:41,298 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:32:41,308 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-41.i[916,929] [2025-03-04 00:32:41,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:32:41,425 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:32:41,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41 WrapperNode [2025-03-04 00:32:41,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:32:41,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:32:41,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:32:41,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:32:41,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,525 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 678 [2025-03-04 00:32:41,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:32:41,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:32:41,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:32:41,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:32:41,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,622 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-04 00:32:41,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:32:41,679 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:32:41,679 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:32:41,680 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:32:41,680 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (1/1) ... [2025-03-04 00:32:41,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:32:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:41,709 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-04 00:32:41,711 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-04 00:32:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:32:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:32:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:32:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:32:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:32:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:32:41,849 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:32:41,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:32:42,591 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: havoc property_#t~ite45#1;havoc property_#t~ite44#1;havoc property_#t~bitwise43#1;havoc property_#t~short46#1;havoc property_#t~ite48#1;havoc property_#t~bitwise47#1;havoc property_#t~short49#1;havoc property_#t~ite53#1;havoc property_#t~bitwise50#1;havoc property_#t~ite52#1;havoc property_#t~bitwise51#1;havoc property_#t~short54#1; [2025-03-04 00:32:42,704 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-03-04 00:32:42,704 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:32:42,733 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:32:42,733 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:32:42,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:32:42 BoogieIcfgContainer [2025-03-04 00:32:42,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:32:42,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:32:42,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:32:42,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:32:42,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:32:40" (1/3) ... [2025-03-04 00:32:42,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1796ded1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:32:42, skipping insertion in model container [2025-03-04 00:32:42,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:41" (2/3) ... [2025-03-04 00:32:42,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1796ded1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:32:42, skipping insertion in model container [2025-03-04 00:32:42,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:32:42" (3/3) ... [2025-03-04 00:32:42,743 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-41.i [2025-03-04 00:32:42,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:32:42,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-41.i that has 2 procedures, 263 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:32:42,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:32:42,823 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;@1b173604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:32:42,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:32:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 199 states have (on average 1.5628140703517588) internal successors, (311), 200 states have internal predecessors, (311), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:32:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-04 00:32:42,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:42,855 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:42,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:42,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1979383982, now seen corresponding path program 1 times [2025-03-04 00:32:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343115487] [2025-03-04 00:32:42,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:42,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:42,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-04 00:32:43,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-04 00:32:43,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:43,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-04 00:32:43,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343115487] [2025-03-04 00:32:43,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343115487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:32:43,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319373462] [2025-03-04 00:32:43,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:43,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:43,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:43,418 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-04 00:32:43,419 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-04 00:32:43,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-04 00:32:43,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-04 00:32:43,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:43,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:43,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:32:43,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:32:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-04 00:32:43,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:32:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319373462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:32:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:32:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294565915] [2025-03-04 00:32:43,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:43,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:32:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:43,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:32:43,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:32:43,841 INFO L87 Difference]: Start difference. First operand has 263 states, 199 states have (on average 1.5628140703517588) internal successors, (311), 200 states have internal predecessors, (311), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:43,892 INFO L93 Difference]: Finished difference Result 519 states and 920 transitions. [2025-03-04 00:32:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:32:43,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 425 [2025-03-04 00:32:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:43,899 INFO L225 Difference]: With dead ends: 519 [2025-03-04 00:32:43,899 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 00:32:43,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 426 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-04 00:32:43,904 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:43,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:32:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 00:32:43,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-04 00:32:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 196 states have (on average 1.5408163265306123) internal successors, (302), 196 states have internal predecessors, (302), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:32:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 424 transitions. [2025-03-04 00:32:43,954 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 424 transitions. Word has length 425 [2025-03-04 00:32:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:43,955 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 424 transitions. [2025-03-04 00:32:43,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 424 transitions. [2025-03-04 00:32:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-04 00:32:43,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:43,964 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:43,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:32:44,164 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-04 00:32:44,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:44,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1597445063, now seen corresponding path program 1 times [2025-03-04 00:32:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155644241] [2025-03-04 00:32:44,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:44,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:44,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-04 00:32:44,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-04 00:32:44,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:44,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:44,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155644241] [2025-03-04 00:32:44,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155644241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:44,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:44,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:32:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884054753] [2025-03-04 00:32:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:44,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:32:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:44,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:32:44,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:32:44,601 INFO L87 Difference]: Start difference. First operand 259 states and 424 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:44,752 INFO L93 Difference]: Finished difference Result 758 states and 1242 transitions. [2025-03-04 00:32:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:32:44,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 425 [2025-03-04 00:32:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:44,760 INFO L225 Difference]: With dead ends: 758 [2025-03-04 00:32:44,760 INFO L226 Difference]: Without dead ends: 502 [2025-03-04 00:32:44,762 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-04 00:32:44,763 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 387 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:44,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 965 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:32:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-04 00:32:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 309. [2025-03-04 00:32:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 246 states have (on average 1.5609756097560976) internal successors, (384), 246 states have internal predecessors, (384), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:32:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 506 transitions. [2025-03-04 00:32:44,798 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 506 transitions. Word has length 425 [2025-03-04 00:32:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:44,800 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 506 transitions. [2025-03-04 00:32:44,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 506 transitions. [2025-03-04 00:32:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-04 00:32:44,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:44,805 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:44,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:32:44,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:44,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1931906690, now seen corresponding path program 1 times [2025-03-04 00:32:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:44,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477749621] [2025-03-04 00:32:44,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:44,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-04 00:32:44,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-04 00:32:44,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:44,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:45,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477749621] [2025-03-04 00:32:45,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477749621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:45,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:45,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:32:45,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769295281] [2025-03-04 00:32:45,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:45,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:32:45,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:45,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:32:45,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:32:45,236 INFO L87 Difference]: Start difference. First operand 309 states and 506 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:45,322 INFO L93 Difference]: Finished difference Result 852 states and 1392 transitions. [2025-03-04 00:32:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:32:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-04 00:32:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:45,326 INFO L225 Difference]: With dead ends: 852 [2025-03-04 00:32:45,326 INFO L226 Difference]: Without dead ends: 546 [2025-03-04 00:32:45,327 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-04 00:32:45,328 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 367 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:45,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1069 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:32:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-04 00:32:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 379. [2025-03-04 00:32:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 316 states have (on average 1.5791139240506329) internal successors, (499), 316 states have internal predecessors, (499), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:32:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2025-03-04 00:32:45,361 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 426 [2025-03-04 00:32:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:45,363 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2025-03-04 00:32:45,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2025-03-04 00:32:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-04 00:32:45,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:45,366 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:45,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:32:45,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:45,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1701448861, now seen corresponding path program 1 times [2025-03-04 00:32:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518903142] [2025-03-04 00:32:45,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:45,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-04 00:32:45,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-04 00:32:45,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:45,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:47,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:47,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518903142] [2025-03-04 00:32:47,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518903142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:47,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:47,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:32:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568332622] [2025-03-04 00:32:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:47,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:32:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:47,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:32:47,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:32:47,458 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:48,790 INFO L93 Difference]: Finished difference Result 1855 states and 3043 transitions. [2025-03-04 00:32:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:32:48,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 426 [2025-03-04 00:32:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:48,803 INFO L225 Difference]: With dead ends: 1855 [2025-03-04 00:32:48,804 INFO L226 Difference]: Without dead ends: 1479 [2025-03-04 00:32:48,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:32:48,807 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1393 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:48,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 2346 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:32:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2025-03-04 00:32:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1139. [2025-03-04 00:32:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 993 states have (on average 1.5981873111782476) internal successors, (1587), 994 states have internal predecessors, (1587), 142 states have call successors, (142), 3 states have call predecessors, (142), 3 states have return successors, (142), 141 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-04 00:32:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1871 transitions. [2025-03-04 00:32:48,903 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1871 transitions. Word has length 426 [2025-03-04 00:32:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:48,904 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1871 transitions. [2025-03-04 00:32:48,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1871 transitions. [2025-03-04 00:32:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-04 00:32:48,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:48,910 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:48,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:32:48,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:48,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1281932030, now seen corresponding path program 1 times [2025-03-04 00:32:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:48,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372008116] [2025-03-04 00:32:48,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:48,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-04 00:32:49,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-04 00:32:49,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:49,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:49,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372008116] [2025-03-04 00:32:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372008116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:49,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:32:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391147526] [2025-03-04 00:32:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:49,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:32:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:49,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:32:49,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:49,926 INFO L87 Difference]: Start difference. First operand 1139 states and 1871 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:50,445 INFO L93 Difference]: Finished difference Result 3655 states and 5966 transitions. [2025-03-04 00:32:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:32:50,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-04 00:32:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:50,458 INFO L225 Difference]: With dead ends: 3655 [2025-03-04 00:32:50,459 INFO L226 Difference]: Without dead ends: 2519 [2025-03-04 00:32:50,461 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-04 00:32:50,462 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 710 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:50,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1601 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:32:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2025-03-04 00:32:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 1942. [2025-03-04 00:32:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1671 states have (on average 1.5816876122082586) internal successors, (2643), 1675 states have internal predecessors, (2643), 264 states have call successors, (264), 6 states have call predecessors, (264), 6 states have return successors, (264), 260 states have call predecessors, (264), 264 states have call successors, (264) [2025-03-04 00:32:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3171 transitions. [2025-03-04 00:32:50,568 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3171 transitions. Word has length 426 [2025-03-04 00:32:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:50,569 INFO L471 AbstractCegarLoop]: Abstraction has 1942 states and 3171 transitions. [2025-03-04 00:32:50,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3171 transitions. [2025-03-04 00:32:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-04 00:32:50,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:50,574 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:50,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:32:50,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:50,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1268399229, now seen corresponding path program 1 times [2025-03-04 00:32:50,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:50,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933850440] [2025-03-04 00:32:50,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:50,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-04 00:32:50,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-04 00:32:50,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:50,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:50,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:50,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933850440] [2025-03-04 00:32:50,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933850440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:50,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:50,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:32:50,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420529732] [2025-03-04 00:32:50,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:50,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:32:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:50,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:32:50,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:32:50,808 INFO L87 Difference]: Start difference. First operand 1942 states and 3171 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:50,941 INFO L93 Difference]: Finished difference Result 3881 states and 6326 transitions. [2025-03-04 00:32:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:32:50,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-04 00:32:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:50,953 INFO L225 Difference]: With dead ends: 3881 [2025-03-04 00:32:50,954 INFO L226 Difference]: Without dead ends: 1942 [2025-03-04 00:32:50,960 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-04 00:32:50,961 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 325 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:50,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 971 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:32:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2025-03-04 00:32:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1576. [2025-03-04 00:32:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1428 states have (on average 1.611344537815126) internal successors, (2301), 1429 states have internal predecessors, (2301), 142 states have call successors, (142), 5 states have call predecessors, (142), 5 states have return successors, (142), 141 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-04 00:32:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2585 transitions. [2025-03-04 00:32:51,069 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2585 transitions. Word has length 426 [2025-03-04 00:32:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:51,070 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2585 transitions. [2025-03-04 00:32:51,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2585 transitions. [2025-03-04 00:32:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-04 00:32:51,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:51,076 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:51,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:32:51,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:51,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash 84910468, now seen corresponding path program 1 times [2025-03-04 00:32:51,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:51,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861940614] [2025-03-04 00:32:51,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:51,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:51,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-04 00:32:51,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-04 00:32:51,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:51,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861940614] [2025-03-04 00:32:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861940614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:52,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:52,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:32:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022007825] [2025-03-04 00:32:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:52,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:32:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:52,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:32:52,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:32:52,306 INFO L87 Difference]: Start difference. First operand 1576 states and 2585 transitions. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:53,736 INFO L93 Difference]: Finished difference Result 7856 states and 12969 transitions. [2025-03-04 00:32:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:32:53,737 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 426 [2025-03-04 00:32:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:53,762 INFO L225 Difference]: With dead ends: 7856 [2025-03-04 00:32:53,763 INFO L226 Difference]: Without dead ends: 6283 [2025-03-04 00:32:53,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:32:53,770 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 2400 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2400 SdHoareTripleChecker+Valid, 3597 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:53,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2400 Valid, 3597 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:32:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2025-03-04 00:32:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 2133. [2025-03-04 00:32:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 1921 states have (on average 1.5996876626756897) internal successors, (3073), 1922 states have internal predecessors, (3073), 203 states have call successors, (203), 8 states have call predecessors, (203), 8 states have return successors, (203), 202 states have call predecessors, (203), 203 states have call successors, (203) [2025-03-04 00:32:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3479 transitions. [2025-03-04 00:32:53,888 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3479 transitions. Word has length 426 [2025-03-04 00:32:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:53,888 INFO L471 AbstractCegarLoop]: Abstraction has 2133 states and 3479 transitions. [2025-03-04 00:32:53,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3479 transitions. [2025-03-04 00:32:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-04 00:32:53,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:53,893 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:53,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:32:53,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:53,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1722937053, now seen corresponding path program 1 times [2025-03-04 00:32:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119119356] [2025-03-04 00:32:53,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:53,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:53,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-04 00:32:54,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-04 00:32:54,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:54,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119119356] [2025-03-04 00:32:54,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119119356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:54,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:54,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:32:54,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249897197] [2025-03-04 00:32:54,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:54,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:32:54,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:54,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:32:54,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:54,652 INFO L87 Difference]: Start difference. First operand 2133 states and 3479 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:54,953 INFO L93 Difference]: Finished difference Result 5134 states and 8424 transitions. [2025-03-04 00:32:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:32:54,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-04 00:32:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:54,968 INFO L225 Difference]: With dead ends: 5134 [2025-03-04 00:32:54,968 INFO L226 Difference]: Without dead ends: 3129 [2025-03-04 00:32:54,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:32:54,973 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 360 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:54,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1239 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:32:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-03-04 00:32:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 1701. [2025-03-04 00:32:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1489 states have (on average 1.590329079919409) internal successors, (2368), 1490 states have internal predecessors, (2368), 203 states have call successors, (203), 8 states have call predecessors, (203), 8 states have return successors, (203), 202 states have call predecessors, (203), 203 states have call successors, (203) [2025-03-04 00:32:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2774 transitions. [2025-03-04 00:32:55,063 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2774 transitions. Word has length 426 [2025-03-04 00:32:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:55,065 INFO L471 AbstractCegarLoop]: Abstraction has 1701 states and 2774 transitions. [2025-03-04 00:32:55,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2774 transitions. [2025-03-04 00:32:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-04 00:32:55,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:55,070 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:55,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:32:55,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:55,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash 951962693, now seen corresponding path program 1 times [2025-03-04 00:32:55,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:55,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121719344] [2025-03-04 00:32:55,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:55,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-04 00:32:55,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-04 00:32:55,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:55,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:55,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121719344] [2025-03-04 00:32:55,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121719344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:55,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:55,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:32:55,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417783338] [2025-03-04 00:32:55,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:55,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:32:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:55,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:32:55,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:32:55,886 INFO L87 Difference]: Start difference. First operand 1701 states and 2774 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:57,651 INFO L93 Difference]: Finished difference Result 6080 states and 9965 transitions. [2025-03-04 00:32:57,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:32:57,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 426 [2025-03-04 00:32:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:57,692 INFO L225 Difference]: With dead ends: 6080 [2025-03-04 00:32:57,693 INFO L226 Difference]: Without dead ends: 4507 [2025-03-04 00:32:57,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:32:57,697 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 1482 mSDsluCounter, 2249 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:57,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 2881 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:32:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2025-03-04 00:32:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3465. [2025-03-04 00:32:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3149 states have (on average 1.6059066370276278) internal successors, (5057), 3153 states have internal predecessors, (5057), 303 states have call successors, (303), 12 states have call predecessors, (303), 12 states have return successors, (303), 299 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-04 00:32:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 5663 transitions. [2025-03-04 00:32:57,851 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 5663 transitions. Word has length 426 [2025-03-04 00:32:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:57,852 INFO L471 AbstractCegarLoop]: Abstraction has 3465 states and 5663 transitions. [2025-03-04 00:32:57,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 5663 transitions. [2025-03-04 00:32:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-04 00:32:57,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:57,856 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:57,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:32:57,857 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:57,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash -855884828, now seen corresponding path program 1 times [2025-03-04 00:32:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:57,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493908641] [2025-03-04 00:32:57,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:57,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:57,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-04 00:32:58,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-04 00:32:58,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:58,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493908641] [2025-03-04 00:32:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493908641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:58,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:58,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:32:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343752614] [2025-03-04 00:32:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:58,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:32:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:58,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:32:58,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:32:58,750 INFO L87 Difference]: Start difference. First operand 3465 states and 5663 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:59,265 INFO L93 Difference]: Finished difference Result 5600 states and 9162 transitions. [2025-03-04 00:32:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:32:59,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-04 00:32:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:59,285 INFO L225 Difference]: With dead ends: 5600 [2025-03-04 00:32:59,285 INFO L226 Difference]: Without dead ends: 2839 [2025-03-04 00:32:59,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-04 00:32:59,294 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 349 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:59,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1474 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:32:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2025-03-04 00:32:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2828. [2025-03-04 00:32:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2533 states have (on average 1.6000789577575998) internal successors, (4053), 2536 states have internal predecessors, (4053), 283 states have call successors, (283), 11 states have call predecessors, (283), 11 states have return successors, (283), 280 states have call predecessors, (283), 283 states have call successors, (283) [2025-03-04 00:32:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4619 transitions. [2025-03-04 00:32:59,416 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4619 transitions. Word has length 426 [2025-03-04 00:32:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:59,416 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 4619 transitions. [2025-03-04 00:32:59,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4619 transitions. [2025-03-04 00:32:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-04 00:32:59,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:59,419 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:32:59,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:59,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1238924548, now seen corresponding path program 1 times [2025-03-04 00:32:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880885655] [2025-03-04 00:32:59,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:59,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-04 00:32:59,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-04 00:32:59,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:59,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:00,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:00,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880885655] [2025-03-04 00:33:00,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880885655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:00,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:00,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:33:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883763786] [2025-03-04 00:33:00,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:00,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:33:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:00,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:33:00,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:33:00,280 INFO L87 Difference]: Start difference. First operand 2828 states and 4619 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:33:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:01,642 INFO L93 Difference]: Finished difference Result 5885 states and 9588 transitions. [2025-03-04 00:33:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:01,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 427 [2025-03-04 00:33:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:01,660 INFO L225 Difference]: With dead ends: 5885 [2025-03-04 00:33:01,661 INFO L226 Difference]: Without dead ends: 4203 [2025-03-04 00:33:01,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:33:01,666 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 970 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:01,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1819 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:33:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2025-03-04 00:33:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3469. [2025-03-04 00:33:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 3153 states have (on average 1.6051379638439582) internal successors, (5061), 3157 states have internal predecessors, (5061), 303 states have call successors, (303), 12 states have call predecessors, (303), 12 states have return successors, (303), 299 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-04 00:33:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 5667 transitions. [2025-03-04 00:33:01,806 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 5667 transitions. Word has length 427 [2025-03-04 00:33:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:01,806 INFO L471 AbstractCegarLoop]: Abstraction has 3469 states and 5667 transitions. [2025-03-04 00:33:01,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:33:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 5667 transitions. [2025-03-04 00:33:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-04 00:33:01,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:01,826 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:01,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:33:01,827 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:01,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:01,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1118804675, now seen corresponding path program 1 times [2025-03-04 00:33:01,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:01,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846234395] [2025-03-04 00:33:01,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:01,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-04 00:33:02,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-04 00:33:02,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:02,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:02,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846234395] [2025-03-04 00:33:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846234395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:02,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:02,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:33:02,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164186261] [2025-03-04 00:33:02,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:02,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:33:02,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:02,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:33:02,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:02,522 INFO L87 Difference]: Start difference. First operand 3469 states and 5667 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:03,157 INFO L93 Difference]: Finished difference Result 11074 states and 18089 transitions. [2025-03-04 00:33:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 427 [2025-03-04 00:33:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:03,180 INFO L225 Difference]: With dead ends: 11074 [2025-03-04 00:33:03,180 INFO L226 Difference]: Without dead ends: 8225 [2025-03-04 00:33:03,187 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-04 00:33:03,188 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 1697 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:03,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 1028 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:33:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8225 states. [2025-03-04 00:33:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8225 to 3517. [2025-03-04 00:33:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3198 states have (on average 1.600375234521576) internal successors, (5118), 3202 states have internal predecessors, (5118), 303 states have call successors, (303), 15 states have call predecessors, (303), 15 states have return successors, (303), 299 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-04 00:33:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 5724 transitions. [2025-03-04 00:33:03,452 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 5724 transitions. Word has length 427 [2025-03-04 00:33:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:03,453 INFO L471 AbstractCegarLoop]: Abstraction has 3517 states and 5724 transitions. [2025-03-04 00:33:03,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 5724 transitions. [2025-03-04 00:33:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-04 00:33:03,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:03,459 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:03,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:33:03,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:03,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1055875422, now seen corresponding path program 1 times [2025-03-04 00:33:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:03,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690163186] [2025-03-04 00:33:03,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:03,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:03,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-04 00:33:03,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-04 00:33:03,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:03,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:04,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:04,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690163186] [2025-03-04 00:33:04,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690163186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:04,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754651956] [2025-03-04 00:33:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:04,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:04,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:04,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:04,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:04,048 INFO L87 Difference]: Start difference. First operand 3517 states and 5724 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:04,480 INFO L93 Difference]: Finished difference Result 8355 states and 13534 transitions. [2025-03-04 00:33:04,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:04,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 427 [2025-03-04 00:33:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:04,497 INFO L225 Difference]: With dead ends: 8355 [2025-03-04 00:33:04,497 INFO L226 Difference]: Without dead ends: 5655 [2025-03-04 00:33:04,503 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-04 00:33:04,503 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 769 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:04,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1761 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:33:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2025-03-04 00:33:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 4240. [2025-03-04 00:33:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4240 states, 3921 states have (on average 1.585564906911502) internal successors, (6217), 3925 states have internal predecessors, (6217), 303 states have call successors, (303), 15 states have call predecessors, (303), 15 states have return successors, (303), 299 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-04 00:33:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 6823 transitions. [2025-03-04 00:33:04,692 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 6823 transitions. Word has length 427 [2025-03-04 00:33:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:04,693 INFO L471 AbstractCegarLoop]: Abstraction has 4240 states and 6823 transitions. [2025-03-04 00:33:04,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 6823 transitions. [2025-03-04 00:33:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-04 00:33:04,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:04,698 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:04,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:33:04,698 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:04,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash -107348290, now seen corresponding path program 1 times [2025-03-04 00:33:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806732438] [2025-03-04 00:33:04,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:04,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-04 00:33:04,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-04 00:33:04,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:04,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:04,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806732438] [2025-03-04 00:33:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806732438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:04,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:04,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:33:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913489543] [2025-03-04 00:33:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:04,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:33:04,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:04,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:33:04,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:04,957 INFO L87 Difference]: Start difference. First operand 4240 states and 6823 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:05,201 INFO L93 Difference]: Finished difference Result 9111 states and 14659 transitions. [2025-03-04 00:33:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:33:05,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 427 [2025-03-04 00:33:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:05,220 INFO L225 Difference]: With dead ends: 9111 [2025-03-04 00:33:05,220 INFO L226 Difference]: Without dead ends: 6313 [2025-03-04 00:33:05,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-04 00:33:05,227 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 272 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:05,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 913 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:33:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2025-03-04 00:33:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 6311. [2025-03-04 00:33:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6311 states, 5740 states have (on average 1.5717770034843206) internal successors, (9022), 5748 states have internal predecessors, (9022), 545 states have call successors, (545), 25 states have call predecessors, (545), 25 states have return successors, (545), 537 states have call predecessors, (545), 545 states have call successors, (545) [2025-03-04 00:33:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6311 states to 6311 states and 10112 transitions. [2025-03-04 00:33:05,510 INFO L78 Accepts]: Start accepts. Automaton has 6311 states and 10112 transitions. Word has length 427 [2025-03-04 00:33:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:05,511 INFO L471 AbstractCegarLoop]: Abstraction has 6311 states and 10112 transitions. [2025-03-04 00:33:05,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6311 states and 10112 transitions. [2025-03-04 00:33:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-04 00:33:05,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:05,516 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:05,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:33:05,516 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:05,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2043008577, now seen corresponding path program 1 times [2025-03-04 00:33:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:05,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359543762] [2025-03-04 00:33:05,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:05,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-04 00:33:05,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-04 00:33:05,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:05,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:05,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:05,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359543762] [2025-03-04 00:33:05,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359543762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:05,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:05,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:05,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090024772] [2025-03-04 00:33:05,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:05,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:05,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:05,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:05,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:05,979 INFO L87 Difference]: Start difference. First operand 6311 states and 10112 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:06,490 INFO L93 Difference]: Finished difference Result 14397 states and 23154 transitions. [2025-03-04 00:33:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:06,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 427 [2025-03-04 00:33:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:06,514 INFO L225 Difference]: With dead ends: 14397 [2025-03-04 00:33:06,514 INFO L226 Difference]: Without dead ends: 9008 [2025-03-04 00:33:06,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04 00:33:06,525 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 413 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:06,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1819 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:33:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9008 states. [2025-03-04 00:33:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9008 to 9006. [2025-03-04 00:33:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9006 states, 8183 states have (on average 1.5677624343150434) internal successors, (12829), 8195 states have internal predecessors, (12829), 787 states have call successors, (787), 35 states have call predecessors, (787), 35 states have return successors, (787), 775 states have call predecessors, (787), 787 states have call successors, (787) [2025-03-04 00:33:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9006 states to 9006 states and 14403 transitions. [2025-03-04 00:33:07,117 INFO L78 Accepts]: Start accepts. Automaton has 9006 states and 14403 transitions. Word has length 427 [2025-03-04 00:33:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:07,118 INFO L471 AbstractCegarLoop]: Abstraction has 9006 states and 14403 transitions. [2025-03-04 00:33:07,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 9006 states and 14403 transitions. [2025-03-04 00:33:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-04 00:33:07,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:07,123 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:07,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:33:07,124 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:07,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash -342268098, now seen corresponding path program 1 times [2025-03-04 00:33:07,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:07,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107612909] [2025-03-04 00:33:07,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:07,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-04 00:33:07,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-04 00:33:07,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:07,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 30 proven. 150 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107612909] [2025-03-04 00:33:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107612909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147140130] [2025-03-04 00:33:08,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:08,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:08,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:08,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:08,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:33:08,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-04 00:33:08,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-04 00:33:08,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:08,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:08,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:33:08,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2850 proven. 45 refuted. 0 times theorem prover too weak. 4425 trivial. 0 not checked. [2025-03-04 00:33:08,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:33:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:08,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147140130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:33:08,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:33:08,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 00:33:08,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998654099] [2025-03-04 00:33:08,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:33:08,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:33:08,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:08,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:33:08,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:33:08,905 INFO L87 Difference]: Start difference. First operand 9006 states and 14403 transitions. Second operand has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 3 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 3 states have call predecessors, (128), 3 states have call successors, (128) [2025-03-04 00:33:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:09,635 INFO L93 Difference]: Finished difference Result 17916 states and 28538 transitions. [2025-03-04 00:33:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:33:09,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 3 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 3 states have call predecessors, (128), 3 states have call successors, (128) Word has length 427 [2025-03-04 00:33:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:09,656 INFO L225 Difference]: With dead ends: 17916 [2025-03-04 00:33:09,656 INFO L226 Difference]: Without dead ends: 9108 [2025-03-04 00:33:09,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 851 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:33:09,667 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 758 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:09,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 857 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:33:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9108 states. [2025-03-04 00:33:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9108 to 9038. [2025-03-04 00:33:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9038 states, 8189 states have (on average 1.5463426547808035) internal successors, (12663), 8201 states have internal predecessors, (12663), 787 states have call successors, (787), 61 states have call predecessors, (787), 61 states have return successors, (787), 775 states have call predecessors, (787), 787 states have call successors, (787) [2025-03-04 00:33:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9038 states to 9038 states and 14237 transitions. [2025-03-04 00:33:10,182 INFO L78 Accepts]: Start accepts. Automaton has 9038 states and 14237 transitions. Word has length 427 [2025-03-04 00:33:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:10,183 INFO L471 AbstractCegarLoop]: Abstraction has 9038 states and 14237 transitions. [2025-03-04 00:33:10,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 3 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 3 states have call predecessors, (128), 3 states have call successors, (128) [2025-03-04 00:33:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 9038 states and 14237 transitions. [2025-03-04 00:33:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-04 00:33:10,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:10,189 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:10,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:33:10,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 00:33:10,390 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:10,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1478891161, now seen corresponding path program 1 times [2025-03-04 00:33:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910726231] [2025-03-04 00:33:10,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:10,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-04 00:33:10,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-04 00:33:10,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:10,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 60 proven. 120 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:11,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:11,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910726231] [2025-03-04 00:33:11,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910726231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:11,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089973965] [2025-03-04 00:33:11,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:11,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:11,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:11,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:11,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:33:11,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-04 00:33:11,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-04 00:33:11,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:11,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:11,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:33:11,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 1998 proven. 27 refuted. 0 times theorem prover too weak. 5295 trivial. 0 not checked. [2025-03-04 00:33:11,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:33:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:11,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089973965] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:33:11,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:33:11,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 00:33:11,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608567203] [2025-03-04 00:33:11,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:33:11,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:33:11,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:12,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:33:12,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:33:12,000 INFO L87 Difference]: Start difference. First operand 9038 states and 14237 transitions. Second operand has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 4 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 4 states have call predecessors, (132), 4 states have call successors, (132) [2025-03-04 00:33:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:13,381 INFO L93 Difference]: Finished difference Result 13135 states and 20483 transitions. [2025-03-04 00:33:13,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 00:33:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 4 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 4 states have call predecessors, (132), 4 states have call successors, (132) Word has length 428 [2025-03-04 00:33:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:13,416 INFO L225 Difference]: With dead ends: 13135 [2025-03-04 00:33:13,416 INFO L226 Difference]: Without dead ends: 5992 [2025-03-04 00:33:13,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 855 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:33:13,444 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1247 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:13,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1720 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:33:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2025-03-04 00:33:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 5917. [2025-03-04 00:33:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5917 states, 5054 states have (on average 1.501187178472497) internal successors, (7587), 5066 states have internal predecessors, (7587), 787 states have call successors, (787), 75 states have call predecessors, (787), 75 states have return successors, (787), 775 states have call predecessors, (787), 787 states have call successors, (787) [2025-03-04 00:33:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5917 states to 5917 states and 9161 transitions. [2025-03-04 00:33:13,962 INFO L78 Accepts]: Start accepts. Automaton has 5917 states and 9161 transitions. Word has length 428 [2025-03-04 00:33:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:13,963 INFO L471 AbstractCegarLoop]: Abstraction has 5917 states and 9161 transitions. [2025-03-04 00:33:13,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 4 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 4 states have call predecessors, (132), 4 states have call successors, (132) [2025-03-04 00:33:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5917 states and 9161 transitions. [2025-03-04 00:33:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:33:13,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:13,967 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:13,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:33:14,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:14,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:14,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:14,169 INFO L85 PathProgramCache]: Analyzing trace with hash 713896672, now seen corresponding path program 1 times [2025-03-04 00:33:14,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:14,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61239335] [2025-03-04 00:33:14,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:14,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:14,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:33:14,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:33:14,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:14,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:14,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:14,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61239335] [2025-03-04 00:33:14,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61239335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:14,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:33:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215451080] [2025-03-04 00:33:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:14,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:33:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:14,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:33:14,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:14,883 INFO L87 Difference]: Start difference. First operand 5917 states and 9161 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:15,317 INFO L93 Difference]: Finished difference Result 8767 states and 13576 transitions. [2025-03-04 00:33:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:15,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 430 [2025-03-04 00:33:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:15,330 INFO L225 Difference]: With dead ends: 8767 [2025-03-04 00:33:15,331 INFO L226 Difference]: Without dead ends: 3284 [2025-03-04 00:33:15,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:33:15,339 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 338 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:15,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1290 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:33:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2025-03-04 00:33:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 1992. [2025-03-04 00:33:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1657 states have (on average 1.4490042245021122) internal successors, (2401), 1661 states have internal predecessors, (2401), 303 states have call successors, (303), 31 states have call predecessors, (303), 31 states have return successors, (303), 299 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-04 00:33:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 3007 transitions. [2025-03-04 00:33:15,545 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 3007 transitions. Word has length 430 [2025-03-04 00:33:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:15,546 INFO L471 AbstractCegarLoop]: Abstraction has 1992 states and 3007 transitions. [2025-03-04 00:33:15,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 3007 transitions. [2025-03-04 00:33:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-04 00:33:15,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:15,548 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:15,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 00:33:15,549 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash -662693511, now seen corresponding path program 1 times [2025-03-04 00:33:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:15,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302653329] [2025-03-04 00:33:15,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:15,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:16,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:16,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:16,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 138 proven. 42 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:17,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:17,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302653329] [2025-03-04 00:33:17,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302653329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:17,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649050795] [2025-03-04 00:33:17,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:17,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:17,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:17,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:17,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:33:17,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:17,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:17,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:17,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:17,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:33:17,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2728 proven. 42 refuted. 0 times theorem prover too weak. 4550 trivial. 0 not checked. [2025-03-04 00:33:17,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:33:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 138 proven. 42 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:17,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649050795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:33:17,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:33:17,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:33:17,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821978176] [2025-03-04 00:33:17,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:33:17,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:33:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:17,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:33:17,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:33:17,660 INFO L87 Difference]: Start difference. First operand 1992 states and 3007 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 2 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-04 00:33:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:18,152 INFO L93 Difference]: Finished difference Result 3742 states and 5647 transitions. [2025-03-04 00:33:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:33:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 2 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 431 [2025-03-04 00:33:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:18,159 INFO L225 Difference]: With dead ends: 3742 [2025-03-04 00:33:18,159 INFO L226 Difference]: Without dead ends: 1914 [2025-03-04 00:33:18,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 859 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:33:18,162 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 545 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:18,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 957 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:33:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2025-03-04 00:33:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1884. [2025-03-04 00:33:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1546 states have (on average 1.426908150064683) internal successors, (2206), 1550 states have internal predecessors, (2206), 303 states have call successors, (303), 34 states have call predecessors, (303), 34 states have return successors, (303), 299 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-04 00:33:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2812 transitions. [2025-03-04 00:33:18,312 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2812 transitions. Word has length 431 [2025-03-04 00:33:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:18,313 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2812 transitions. [2025-03-04 00:33:18,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 2 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-04 00:33:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2812 transitions. [2025-03-04 00:33:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-04 00:33:18,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:18,316 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:18,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:33:18,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:18,517 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:18,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash -772897576, now seen corresponding path program 1 times [2025-03-04 00:33:18,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:18,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985157834] [2025-03-04 00:33:18,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:18,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:18,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:19,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:19,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:19,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 111 proven. 243 refuted. 0 times theorem prover too weak. 6966 trivial. 0 not checked. [2025-03-04 00:33:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985157834] [2025-03-04 00:33:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985157834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450948395] [2025-03-04 00:33:19,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:19,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:19,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:19,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:19,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:33:19,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:20,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:20,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:20,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:20,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:33:20,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3775 proven. 354 refuted. 0 times theorem prover too weak. 3191 trivial. 0 not checked. [2025-03-04 00:33:21,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:33:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 282 proven. 249 refuted. 0 times theorem prover too weak. 6789 trivial. 0 not checked. [2025-03-04 00:33:22,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450948395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:33:22,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:33:22,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 14] total 36 [2025-03-04 00:33:22,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092591309] [2025-03-04 00:33:22,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:33:22,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 00:33:22,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:22,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 00:33:22,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 00:33:22,138 INFO L87 Difference]: Start difference. First operand 1884 states and 2812 transitions. Second operand has 36 states, 34 states have (on average 9.647058823529411) internal successors, (328), 34 states have internal predecessors, (328), 12 states have call successors, (146), 5 states have call predecessors, (146), 11 states have return successors, (147), 10 states have call predecessors, (147), 12 states have call successors, (147) [2025-03-04 00:33:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:24,945 INFO L93 Difference]: Finished difference Result 3647 states and 5308 transitions. [2025-03-04 00:33:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-04 00:33:24,946 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 9.647058823529411) internal successors, (328), 34 states have internal predecessors, (328), 12 states have call successors, (146), 5 states have call predecessors, (146), 11 states have return successors, (147), 10 states have call predecessors, (147), 12 states have call successors, (147) Word has length 431 [2025-03-04 00:33:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:24,953 INFO L225 Difference]: With dead ends: 3647 [2025-03-04 00:33:24,953 INFO L226 Difference]: Without dead ends: 2216 [2025-03-04 00:33:24,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 939 GetRequests, 849 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2056 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2116, Invalid=6074, Unknown=0, NotChecked=0, Total=8190 [2025-03-04 00:33:24,957 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 2257 mSDsluCounter, 2915 mSDsCounter, 0 mSdLazyCounter, 3369 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 4138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 3369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:24,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 3381 Invalid, 4138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 3369 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 00:33:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2025-03-04 00:33:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1420. [2025-03-04 00:33:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1102 states have (on average 1.3548094373865698) internal successors, (1493), 1104 states have internal predecessors, (1493), 263 states have call successors, (263), 54 states have call predecessors, (263), 54 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-04 00:33:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2019 transitions. [2025-03-04 00:33:25,128 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2019 transitions. Word has length 431 [2025-03-04 00:33:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:25,130 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 2019 transitions. [2025-03-04 00:33:25,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 9.647058823529411) internal successors, (328), 34 states have internal predecessors, (328), 12 states have call successors, (146), 5 states have call predecessors, (146), 11 states have return successors, (147), 10 states have call predecessors, (147), 12 states have call successors, (147) [2025-03-04 00:33:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2019 transitions. [2025-03-04 00:33:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-04 00:33:25,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:25,132 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:25,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:33:25,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:25,333 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1102433624, now seen corresponding path program 1 times [2025-03-04 00:33:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113652202] [2025-03-04 00:33:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:25,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:25,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:25,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:25,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 162 proven. 192 refuted. 0 times theorem prover too weak. 6966 trivial. 0 not checked. [2025-03-04 00:33:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113652202] [2025-03-04 00:33:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113652202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791455806] [2025-03-04 00:33:29,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:29,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:29,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:29,818 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:29,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:33:30,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:30,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:30,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:30,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:30,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 00:33:30,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 4927 proven. 432 refuted. 0 times theorem prover too weak. 1961 trivial. 0 not checked. [2025-03-04 00:33:31,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:33:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 408 proven. 462 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2025-03-04 00:33:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791455806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:33:33,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:33:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 44 [2025-03-04 00:33:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611710675] [2025-03-04 00:33:33,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:33:33,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 00:33:33,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:33,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 00:33:33,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1556, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 00:33:33,369 INFO L87 Difference]: Start difference. First operand 1420 states and 2019 transitions. Second operand has 44 states, 40 states have (on average 9.475) internal successors, (379), 40 states have internal predecessors, (379), 16 states have call successors, (162), 6 states have call predecessors, (162), 14 states have return successors, (163), 14 states have call predecessors, (163), 16 states have call successors, (163) [2025-03-04 00:33:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:47,889 INFO L93 Difference]: Finished difference Result 4409 states and 6322 transitions. [2025-03-04 00:33:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2025-03-04 00:33:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 9.475) internal successors, (379), 40 states have internal predecessors, (379), 16 states have call successors, (162), 6 states have call predecessors, (162), 14 states have return successors, (163), 14 states have call predecessors, (163), 16 states have call successors, (163) Word has length 431 [2025-03-04 00:33:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:47,900 INFO L225 Difference]: With dead ends: 4409 [2025-03-04 00:33:47,900 INFO L226 Difference]: Without dead ends: 3398 [2025-03-04 00:33:47,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 995 GetRequests, 844 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7747 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=4987, Invalid=18269, Unknown=0, NotChecked=0, Total=23256 [2025-03-04 00:33:47,907 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 8078 mSDsluCounter, 5058 mSDsCounter, 0 mSdLazyCounter, 4478 mSolverCounterSat, 1237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8098 SdHoareTripleChecker+Valid, 5511 SdHoareTripleChecker+Invalid, 5715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1237 IncrementalHoareTripleChecker+Valid, 4478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:47,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8098 Valid, 5511 Invalid, 5715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1237 Valid, 4478 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-04 00:33:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2025-03-04 00:33:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 1976. [2025-03-04 00:33:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1636 states have (on average 1.3820293398533008) internal successors, (2261), 1638 states have internal predecessors, (2261), 263 states have call successors, (263), 76 states have call predecessors, (263), 76 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-04 00:33:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2787 transitions. [2025-03-04 00:33:48,155 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2787 transitions. Word has length 431 [2025-03-04 00:33:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:48,155 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 2787 transitions. [2025-03-04 00:33:48,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 9.475) internal successors, (379), 40 states have internal predecessors, (379), 16 states have call successors, (162), 6 states have call predecessors, (162), 14 states have return successors, (163), 14 states have call predecessors, (163), 16 states have call successors, (163) [2025-03-04 00:33:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2787 transitions. [2025-03-04 00:33:48,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-04 00:33:48,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:48,158 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:48,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:33:48,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:48,364 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:48,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1104954070, now seen corresponding path program 1 times [2025-03-04 00:33:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:48,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976178630] [2025-03-04 00:33:48,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:48,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:48,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:48,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:48,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:48,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976178630] [2025-03-04 00:33:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976178630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:48,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:48,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:33:48,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228963838] [2025-03-04 00:33:48,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:48,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:33:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:48,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:33:48,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:48,488 INFO L87 Difference]: Start difference. First operand 1976 states and 2787 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:48,720 INFO L93 Difference]: Finished difference Result 3122 states and 4411 transitions. [2025-03-04 00:33:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:33:48,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 431 [2025-03-04 00:33:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:48,729 INFO L225 Difference]: With dead ends: 3122 [2025-03-04 00:33:48,729 INFO L226 Difference]: Without dead ends: 1698 [2025-03-04 00:33:48,731 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-04 00:33:48,732 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 338 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:48,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 359 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:33:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2025-03-04 00:33:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1698. [2025-03-04 00:33:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1358 states have (on average 1.3343151693667157) internal successors, (1812), 1360 states have internal predecessors, (1812), 263 states have call successors, (263), 76 states have call predecessors, (263), 76 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-04 00:33:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2338 transitions. [2025-03-04 00:33:48,974 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2338 transitions. Word has length 431 [2025-03-04 00:33:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:48,974 INFO L471 AbstractCegarLoop]: Abstraction has 1698 states and 2338 transitions. [2025-03-04 00:33:48,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2338 transitions. [2025-03-04 00:33:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-04 00:33:48,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:48,976 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:33:48,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 00:33:48,977 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:48,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1571608100, now seen corresponding path program 1 times [2025-03-04 00:33:48,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:48,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242344038] [2025-03-04 00:33:48,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:48,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-04 00:33:49,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-04 00:33:49,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:49,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 162 proven. 18 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:49,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:49,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242344038] [2025-03-04 00:33:49,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242344038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:49,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003817261] [2025-03-04 00:33:49,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:49,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:49,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:49,921 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:49,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:33:50,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-04 00:33:50,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-04 00:33:50,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:50,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:50,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 00:33:50,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 4798 proven. 402 refuted. 0 times theorem prover too weak. 2120 trivial. 0 not checked. [2025-03-04 00:33:51,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:33:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 162 proven. 369 refuted. 0 times theorem prover too weak. 6789 trivial. 0 not checked. [2025-03-04 00:33:52,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003817261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:33:52,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:33:52,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 13] total 28 [2025-03-04 00:33:52,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049007338] [2025-03-04 00:33:52,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:33:52,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 00:33:52,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:52,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 00:33:52,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2025-03-04 00:33:52,577 INFO L87 Difference]: Start difference. First operand 1698 states and 2338 transitions. Second operand has 28 states, 27 states have (on average 13.148148148148149) internal successors, (355), 26 states have internal predecessors, (355), 10 states have call successors, (145), 5 states have call predecessors, (145), 10 states have return successors, (147), 10 states have call predecessors, (147), 10 states have call successors, (147)