./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.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_loopvsstraightlinecode_25-while_file-22.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 211bead296e124e614440acc5c0a2ec479c384857f4a7a38003b7b558015a0bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:17:56,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:17:56,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:17:56,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:17:56,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:17:56,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:17:56,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:17:56,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:17:56,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:17:56,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:17:56,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:17:56,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:17:56,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:17:56,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:17:56,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:17:56,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:17:56,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:17:56,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:17:56,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:17:56,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:17:56,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:17:56,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:17:56,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:17:56,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:17:56,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:17:56,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:17:56,853 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 -> 211bead296e124e614440acc5c0a2ec479c384857f4a7a38003b7b558015a0bc [2025-03-03 23:17:57,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:17:57,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:17:57,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:17:57,077 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:17:57,077 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:17:57,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2025-03-03 23:17:58,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7fb7216/3ffbd6207bf34e92aac8bc0916728726/FLAG3c0ac4935 [2025-03-03 23:17:58,498 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:17:58,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2025-03-03 23:17:58,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7fb7216/3ffbd6207bf34e92aac8bc0916728726/FLAG3c0ac4935 [2025-03-03 23:17:58,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7fb7216/3ffbd6207bf34e92aac8bc0916728726 [2025-03-03 23:17:58,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:17:58,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:17:58,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:17:58,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:17:58,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:17:58,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:17:58" (1/1) ... [2025-03-03 23:17:58,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c66e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:58, skipping insertion in model container [2025-03-03 23:17:58,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:17:58" (1/1) ... [2025-03-03 23:17:58,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:17:58,936 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_loopvsstraightlinecode_25-while_file-22.i[915,928] [2025-03-03 23:17:58,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:17:58,987 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:17:58,995 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_loopvsstraightlinecode_25-while_file-22.i[915,928] [2025-03-03 23:17:59,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:17:59,033 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:17:59,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59 WrapperNode [2025-03-03 23:17:59,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:17:59,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:17:59,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:17:59,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:17:59,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,074 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-03 23:17:59,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:17:59,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:17:59,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:17:59,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:17:59,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,096 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-03 23:17:59,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:17:59,115 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:17:59,116 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:17:59,116 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:17:59,116 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (1/1) ... [2025-03-03 23:17:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:17:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:17:59,143 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-03 23:17:59,149 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-03 23:17:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:17:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:17:59,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:17:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:17:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:17:59,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:17:59,220 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:17:59,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:17:59,399 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: havoc property_#t~bitwise10#1;havoc property_#t~short11#1; [2025-03-03 23:17:59,414 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 23:17:59,415 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:17:59,428 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:17:59,430 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:17:59,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:17:59 BoogieIcfgContainer [2025-03-03 23:17:59,430 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:17:59,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:17:59,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:17:59,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:17:59,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:17:58" (1/3) ... [2025-03-03 23:17:59,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fd880c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:17:59, skipping insertion in model container [2025-03-03 23:17:59,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:17:59" (2/3) ... [2025-03-03 23:17:59,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fd880c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:17:59, skipping insertion in model container [2025-03-03 23:17:59,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:17:59" (3/3) ... [2025-03-03 23:17:59,438 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-22.i [2025-03-03 23:17:59,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:17:59,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-22.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:17:59,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:17:59,514 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;@50e5f634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:17:59,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:17:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 23:17:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 23:17:59,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:17:59,525 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:17:59,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:17:59,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:17:59,530 INFO L85 PathProgramCache]: Analyzing trace with hash -47698679, now seen corresponding path program 1 times [2025-03-03 23:17:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:17:59,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323478654] [2025-03-03 23:17:59,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:17:59,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:17:59,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 23:17:59,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 23:17:59,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:17:59,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:17:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 23:17:59,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:17:59,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323478654] [2025-03-03 23:17:59,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323478654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:17:59,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393870858] [2025-03-03 23:17:59,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:17:59,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:17:59,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:17:59,696 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-03 23:17:59,697 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-03 23:17:59,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 23:17:59,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 23:17:59,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:17:59,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:17:59,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:17:59,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:17:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 23:17:59,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:17:59,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393870858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:17:59,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:17:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:17:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564239360] [2025-03-03 23:17:59,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:17:59,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:17:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:17:59,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:17:59,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:17:59,826 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 23:17:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:17:59,842 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2025-03-03 23:17:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:17:59,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2025-03-03 23:17:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:17:59,846 INFO L225 Difference]: With dead ends: 86 [2025-03-03 23:17:59,847 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 23:17:59,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-03 23:17:59,850 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:17:59,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:17:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 23:17:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-03 23:17:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 23:17:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-03-03 23:17:59,876 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 58 [2025-03-03 23:17:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:17:59,876 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-03 23:17:59,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 23:17:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2025-03-03 23:17:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 23:17:59,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:17:59,878 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:17:59,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:18:00,078 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-03 23:18:00,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:00,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1322049523, now seen corresponding path program 1 times [2025-03-03 23:18:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:00,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415611559] [2025-03-03 23:18:00,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:00,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 23:18:00,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 23:18:00,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:00,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415611559] [2025-03-03 23:18:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415611559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:00,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:18:00,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266818540] [2025-03-03 23:18:00,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:00,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:18:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:00,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:18:00,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:18:00,556 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:00,729 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2025-03-03 23:18:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:18:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2025-03-03 23:18:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:00,731 INFO L225 Difference]: With dead ends: 141 [2025-03-03 23:18:00,731 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 23:18:00,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:18:00,732 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 84 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:00,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 161 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 23:18:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 72. [2025-03-03 23:18:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 55 states have internal predecessors, (69), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 23:18:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2025-03-03 23:18:00,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 58 [2025-03-03 23:18:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:00,752 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2025-03-03 23:18:00,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2025-03-03 23:18:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 23:18:00,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:00,755 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:18:00,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:18:00,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:00,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash -883943298, now seen corresponding path program 1 times [2025-03-03 23:18:00,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:00,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40982689] [2025-03-03 23:18:00,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:00,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 23:18:00,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 23:18:00,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:00,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:00,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:00,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40982689] [2025-03-03 23:18:00,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40982689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:00,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:00,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:18:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32538809] [2025-03-03 23:18:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:00,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:18:00,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:00,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:18:00,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:18:00,986 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:01,081 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2025-03-03 23:18:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:18:01,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2025-03-03 23:18:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:01,082 INFO L225 Difference]: With dead ends: 136 [2025-03-03 23:18:01,082 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 23:18:01,083 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-03 23:18:01,084 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:01,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 147 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 23:18:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2025-03-03 23:18:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 23:18:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2025-03-03 23:18:01,099 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 59 [2025-03-03 23:18:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:01,100 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2025-03-03 23:18:01,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2025-03-03 23:18:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 23:18:01,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:01,101 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:18:01,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:18:01,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:01,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1637862584, now seen corresponding path program 1 times [2025-03-03 23:18:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:01,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363226234] [2025-03-03 23:18:01,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:01,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 23:18:01,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 23:18:01,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:01,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363226234] [2025-03-03 23:18:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363226234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:01,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:18:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803276466] [2025-03-03 23:18:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:01,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:18:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:01,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:18:01,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:18:01,334 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:01,500 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2025-03-03 23:18:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:18:01,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2025-03-03 23:18:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:01,502 INFO L225 Difference]: With dead ends: 193 [2025-03-03 23:18:01,502 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 23:18:01,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:18:01,503 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 95 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:01,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 211 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 23:18:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2025-03-03 23:18:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 92 states have internal predecessors, (116), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:18:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2025-03-03 23:18:01,519 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 158 transitions. Word has length 59 [2025-03-03 23:18:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:01,519 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 158 transitions. [2025-03-03 23:18:01,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2025-03-03 23:18:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 23:18:01,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:01,520 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:18:01,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:18:01,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:01,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1344459577, now seen corresponding path program 1 times [2025-03-03 23:18:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:01,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260071892] [2025-03-03 23:18:01,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:01,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:01,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 23:18:01,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 23:18:01,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:01,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260071892] [2025-03-03 23:18:01,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260071892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:01,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:18:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808918798] [2025-03-03 23:18:01,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:01,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:18:01,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:01,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:18:01,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:18:01,564 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:01,588 INFO L93 Difference]: Finished difference Result 186 states and 249 transitions. [2025-03-03 23:18:01,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:18:01,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2025-03-03 23:18:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:01,589 INFO L225 Difference]: With dead ends: 186 [2025-03-03 23:18:01,589 INFO L226 Difference]: Without dead ends: 147 [2025-03-03 23:18:01,590 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-03 23:18:01,590 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:01,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 117 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:18:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-03 23:18:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2025-03-03 23:18:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:18:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2025-03-03 23:18:01,610 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 59 [2025-03-03 23:18:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:01,610 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2025-03-03 23:18:01,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2025-03-03 23:18:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 23:18:01,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:01,611 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:18:01,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:18:01,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:01,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 679018803, now seen corresponding path program 1 times [2025-03-03 23:18:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012704592] [2025-03-03 23:18:01,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:01,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 23:18:01,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 23:18:01,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:01,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:02,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:02,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012704592] [2025-03-03 23:18:02,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012704592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:02,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:02,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:18:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355258628] [2025-03-03 23:18:02,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:02,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:18:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:02,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:18:02,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:18:02,275 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:02,567 INFO L93 Difference]: Finished difference Result 309 states and 410 transitions. [2025-03-03 23:18:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:18:02,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2025-03-03 23:18:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:02,569 INFO L225 Difference]: With dead ends: 309 [2025-03-03 23:18:02,569 INFO L226 Difference]: Without dead ends: 210 [2025-03-03 23:18:02,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:18:02,570 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 225 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:02,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 423 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:18:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-03 23:18:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 148. [2025-03-03 23:18:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 115 states have (on average 1.2173913043478262) internal successors, (140), 115 states have internal predecessors, (140), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:18:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 196 transitions. [2025-03-03 23:18:02,608 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 196 transitions. Word has length 60 [2025-03-03 23:18:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:02,609 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 196 transitions. [2025-03-03 23:18:02,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 196 transitions. [2025-03-03 23:18:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 23:18:02,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:02,610 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:18:02,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:18:02,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:02,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1422253425, now seen corresponding path program 1 times [2025-03-03 23:18:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:02,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888720666] [2025-03-03 23:18:02,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:02,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 23:18:02,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 23:18:02,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:02,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:02,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888720666] [2025-03-03 23:18:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888720666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:18:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610472552] [2025-03-03 23:18:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:02,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:18:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:02,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:18:02,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:18:02,642 INFO L87 Difference]: Start difference. First operand 148 states and 196 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:02,682 INFO L93 Difference]: Finished difference Result 350 states and 467 transitions. [2025-03-03 23:18:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:18:02,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2025-03-03 23:18:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:02,684 INFO L225 Difference]: With dead ends: 350 [2025-03-03 23:18:02,684 INFO L226 Difference]: Without dead ends: 224 [2025-03-03 23:18:02,685 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-03 23:18:02,685 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:02,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:18:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-03 23:18:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2025-03-03 23:18:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 173 states have (on average 1.2138728323699421) internal successors, (210), 173 states have internal predecessors, (210), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:18:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 294 transitions. [2025-03-03 23:18:02,706 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 294 transitions. Word has length 60 [2025-03-03 23:18:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:02,706 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 294 transitions. [2025-03-03 23:18:02,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 294 transitions. [2025-03-03 23:18:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 23:18:02,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:02,707 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:18:02,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:18:02,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:02,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash 304703036, now seen corresponding path program 1 times [2025-03-03 23:18:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752753115] [2025-03-03 23:18:02,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:02,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 23:18:02,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 23:18:02,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:02,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752753115] [2025-03-03 23:18:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752753115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:03,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:18:03,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773458161] [2025-03-03 23:18:03,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:03,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:18:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:03,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:18:03,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:18:03,272 INFO L87 Difference]: Start difference. First operand 222 states and 294 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:03,456 INFO L93 Difference]: Finished difference Result 369 states and 484 transitions. [2025-03-03 23:18:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:18:03,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2025-03-03 23:18:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:03,458 INFO L225 Difference]: With dead ends: 369 [2025-03-03 23:18:03,458 INFO L226 Difference]: Without dead ends: 291 [2025-03-03 23:18:03,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:18:03,459 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 81 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:03,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 181 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-03 23:18:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2025-03-03 23:18:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 190 states have (on average 1.2210526315789474) internal successors, (232), 190 states have internal predecessors, (232), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:18:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 316 transitions. [2025-03-03 23:18:03,478 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 316 transitions. Word has length 61 [2025-03-03 23:18:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:03,478 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 316 transitions. [2025-03-03 23:18:03,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 316 transitions. [2025-03-03 23:18:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 23:18:03,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:03,479 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:18:03,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 23:18:03,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash 433785755, now seen corresponding path program 1 times [2025-03-03 23:18:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:03,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832024518] [2025-03-03 23:18:03,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:03,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 23:18:03,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 23:18:03,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:03,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:03,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832024518] [2025-03-03 23:18:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832024518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:03,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:18:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141980649] [2025-03-03 23:18:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:03,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:18:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:03,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:18:03,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:18:03,523 INFO L87 Difference]: Start difference. First operand 239 states and 316 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:03,559 INFO L93 Difference]: Finished difference Result 383 states and 506 transitions. [2025-03-03 23:18:03,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:18:03,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2025-03-03 23:18:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:03,561 INFO L225 Difference]: With dead ends: 383 [2025-03-03 23:18:03,562 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 23:18:03,563 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-03 23:18:03,563 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:03,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:18:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 23:18:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2025-03-03 23:18:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.185483870967742) internal successors, (147), 124 states have internal predecessors, (147), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:18:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2025-03-03 23:18:03,576 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 61 [2025-03-03 23:18:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:03,577 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2025-03-03 23:18:03,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2025-03-03 23:18:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 23:18:03,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:03,578 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:18:03,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 23:18:03,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:03,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:03,578 INFO L85 PathProgramCache]: Analyzing trace with hash -294552201, now seen corresponding path program 1 times [2025-03-03 23:18:03,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:03,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446345923] [2025-03-03 23:18:03,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:03,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 23:18:03,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 23:18:03,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:03,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:04,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446345923] [2025-03-03 23:18:04,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446345923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:04,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:04,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 23:18:04,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176808527] [2025-03-03 23:18:04,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:04,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:18:04,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:04,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:18:04,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:18:04,159 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:04,840 INFO L93 Difference]: Finished difference Result 244 states and 310 transitions. [2025-03-03 23:18:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 23:18:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2025-03-03 23:18:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:04,841 INFO L225 Difference]: With dead ends: 244 [2025-03-03 23:18:04,841 INFO L226 Difference]: Without dead ends: 242 [2025-03-03 23:18:04,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-03-03 23:18:04,842 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 190 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:04,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 490 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:18:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-03 23:18:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 173. [2025-03-03 23:18:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 140 states have (on average 1.1785714285714286) internal successors, (165), 140 states have internal predecessors, (165), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:18:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 221 transitions. [2025-03-03 23:18:04,852 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 221 transitions. Word has length 63 [2025-03-03 23:18:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:04,852 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 221 transitions. [2025-03-03 23:18:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 221 transitions. [2025-03-03 23:18:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 23:18:04,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:04,853 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:18:04,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 23:18:04,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:04,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1800466482, now seen corresponding path program 1 times [2025-03-03 23:18:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809631840] [2025-03-03 23:18:04,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:04,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 23:18:04,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 23:18:04,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:04,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 23:18:05,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809631840] [2025-03-03 23:18:05,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809631840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:05,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:05,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:18:05,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957633029] [2025-03-03 23:18:05,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:05,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:18:05,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:05,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:18:05,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:18:05,260 INFO L87 Difference]: Start difference. First operand 173 states and 221 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:05,438 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2025-03-03 23:18:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:18:05,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2025-03-03 23:18:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:05,439 INFO L225 Difference]: With dead ends: 182 [2025-03-03 23:18:05,441 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 23:18:05,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:18:05,442 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:05,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 408 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 23:18:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2025-03-03 23:18:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 140 states have (on average 1.1714285714285715) internal successors, (164), 140 states have internal predecessors, (164), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:18:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 220 transitions. [2025-03-03 23:18:05,454 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 220 transitions. Word has length 64 [2025-03-03 23:18:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:05,454 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 220 transitions. [2025-03-03 23:18:05,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 220 transitions. [2025-03-03 23:18:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 23:18:05,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:05,455 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:05,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 23:18:05,456 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:05,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2085485139, now seen corresponding path program 1 times [2025-03-03 23:18:05,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:05,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470209674] [2025-03-03 23:18:05,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:05,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 23:18:05,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 23:18:05,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:05,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-03 23:18:06,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:06,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470209674] [2025-03-03 23:18:06,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470209674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:06,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:06,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:18:06,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614992846] [2025-03-03 23:18:06,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:06,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:18:06,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:06,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:18:06,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:18:06,077 INFO L87 Difference]: Start difference. First operand 173 states and 220 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:06,226 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2025-03-03 23:18:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:18:06,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 118 [2025-03-03 23:18:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:06,228 INFO L225 Difference]: With dead ends: 275 [2025-03-03 23:18:06,228 INFO L226 Difference]: Without dead ends: 224 [2025-03-03 23:18:06,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:18:06,228 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 45 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:06,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 227 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-03 23:18:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 180. [2025-03-03 23:18:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.1768707482993197) internal successors, (173), 147 states have internal predecessors, (173), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:18:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 229 transitions. [2025-03-03 23:18:06,244 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 229 transitions. Word has length 118 [2025-03-03 23:18:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:06,245 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 229 transitions. [2025-03-03 23:18:06,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2025-03-03 23:18:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 23:18:06,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:06,246 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:06,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 23:18:06,246 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:06,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1670416120, now seen corresponding path program 1 times [2025-03-03 23:18:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835012519] [2025-03-03 23:18:06,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:06,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 23:18:06,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 23:18:06,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:06,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 23:18:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:06,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835012519] [2025-03-03 23:18:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835012519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:18:06,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089043954] [2025-03-03 23:18:06,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:06,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:18:06,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:18:06,982 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-03 23:18:06,984 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-03 23:18:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 23:18:07,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 23:18:07,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:07,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:07,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 23:18:07,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:18:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-03 23:18:07,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:18:07,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089043954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:07,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:18:07,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2025-03-03 23:18:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611972081] [2025-03-03 23:18:07,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:07,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:18:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:07,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:18:07,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:18:07,733 INFO L87 Difference]: Start difference. First operand 180 states and 229 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:07,873 INFO L93 Difference]: Finished difference Result 271 states and 344 transitions. [2025-03-03 23:18:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:18:07,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 119 [2025-03-03 23:18:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:07,874 INFO L225 Difference]: With dead ends: 271 [2025-03-03 23:18:07,874 INFO L226 Difference]: Without dead ends: 213 [2025-03-03 23:18:07,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:18:07,875 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 35 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:07,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 185 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-03 23:18:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 180. [2025-03-03 23:18:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.1768707482993197) internal successors, (173), 147 states have internal predecessors, (173), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:18:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 229 transitions. [2025-03-03 23:18:07,887 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 229 transitions. Word has length 119 [2025-03-03 23:18:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:07,888 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 229 transitions. [2025-03-03 23:18:07,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2025-03-03 23:18:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 23:18:07,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:07,889 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:07,896 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-03 23:18:08,090 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,SelfDestructingSolverStorable12 [2025-03-03 23:18:08,090 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:08,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1870059409, now seen corresponding path program 1 times [2025-03-03 23:18:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:08,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819819191] [2025-03-03 23:18:08,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:08,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 23:18:08,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 23:18:08,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:08,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 23:18:08,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819819191] [2025-03-03 23:18:08,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819819191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:18:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578085819] [2025-03-03 23:18:08,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:08,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:18:08,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:18:08,621 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-03 23:18:08,623 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-03 23:18:08,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 23:18:08,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 23:18:08,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:08,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:08,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 23:18:08,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:18:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-03 23:18:08,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:18:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578085819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:08,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:18:08,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-03 23:18:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534001994] [2025-03-03 23:18:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:08,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:18:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:08,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:18:08,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:18:08,907 INFO L87 Difference]: Start difference. First operand 180 states and 229 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:09,053 INFO L93 Difference]: Finished difference Result 315 states and 392 transitions. [2025-03-03 23:18:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 23:18:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 120 [2025-03-03 23:18:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:09,055 INFO L225 Difference]: With dead ends: 315 [2025-03-03 23:18:09,055 INFO L226 Difference]: Without dead ends: 313 [2025-03-03 23:18:09,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-03 23:18:09,056 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 38 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:09,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 361 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-03 23:18:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 191. [2025-03-03 23:18:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 158 states have (on average 1.1772151898734178) internal successors, (186), 158 states have internal predecessors, (186), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:18:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2025-03-03 23:18:09,070 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 120 [2025-03-03 23:18:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:09,070 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2025-03-03 23:18:09,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2025-03-03 23:18:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 23:18:09,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:09,071 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:09,078 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-03 23:18:09,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:18:09,272 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:09,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1673545904, now seen corresponding path program 1 times [2025-03-03 23:18:09,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:09,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174469535] [2025-03-03 23:18:09,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:09,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:09,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 23:18:09,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 23:18:09,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:09,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-03-03 23:18:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174469535] [2025-03-03 23:18:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174469535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:09,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:09,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:18:09,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486488840] [2025-03-03 23:18:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:09,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:18:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:09,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:18:09,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:18:09,322 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:09,335 INFO L93 Difference]: Finished difference Result 312 states and 401 transitions. [2025-03-03 23:18:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:18:09,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 120 [2025-03-03 23:18:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:09,337 INFO L225 Difference]: With dead ends: 312 [2025-03-03 23:18:09,337 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 23:18:09,337 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-03 23:18:09,337 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:09,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:18:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 23:18:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-03 23:18:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 158 states have (on average 1.1708860759493671) internal successors, (185), 158 states have internal predecessors, (185), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:18:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 241 transitions. [2025-03-03 23:18:09,351 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 241 transitions. Word has length 120 [2025-03-03 23:18:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:09,351 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 241 transitions. [2025-03-03 23:18:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2025-03-03 23:18:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 23:18:09,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:09,353 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 23:18:09,353 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -141632375, now seen corresponding path program 1 times [2025-03-03 23:18:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:09,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644839927] [2025-03-03 23:18:09,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:09,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 23:18:09,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 23:18:09,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:09,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-03 23:18:09,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644839927] [2025-03-03 23:18:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644839927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:09,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:09,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:18:09,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289007231] [2025-03-03 23:18:09,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:09,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:18:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:09,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:18:09,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:18:09,747 INFO L87 Difference]: Start difference. First operand 191 states and 241 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:09,881 INFO L93 Difference]: Finished difference Result 375 states and 467 transitions. [2025-03-03 23:18:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 23:18:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 120 [2025-03-03 23:18:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:09,883 INFO L225 Difference]: With dead ends: 375 [2025-03-03 23:18:09,883 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 23:18:09,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:18:09,884 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:09,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 241 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 23:18:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 193. [2025-03-03 23:18:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 160 states have (on average 1.1625) internal successors, (186), 160 states have internal predecessors, (186), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:18:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 242 transitions. [2025-03-03 23:18:09,899 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 242 transitions. Word has length 120 [2025-03-03 23:18:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:09,900 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 242 transitions. [2025-03-03 23:18:09,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 242 transitions. [2025-03-03 23:18:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 23:18:09,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:09,901 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:09,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 23:18:09,901 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:09,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:09,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2070790123, now seen corresponding path program 1 times [2025-03-03 23:18:09,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:09,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099116281] [2025-03-03 23:18:09,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:09,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:09,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 23:18:09,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 23:18:09,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:09,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-03-03 23:18:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:09,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099116281] [2025-03-03 23:18:09,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099116281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:09,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:09,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:18:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936057739] [2025-03-03 23:18:09,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:09,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:18:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:09,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:18:09,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:18:09,941 INFO L87 Difference]: Start difference. First operand 193 states and 242 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:09,975 INFO L93 Difference]: Finished difference Result 384 states and 485 transitions. [2025-03-03 23:18:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:18:09,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 121 [2025-03-03 23:18:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:09,977 INFO L225 Difference]: With dead ends: 384 [2025-03-03 23:18:09,977 INFO L226 Difference]: Without dead ends: 261 [2025-03-03 23:18:09,977 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-03 23:18:09,978 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 43 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:09,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 82 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:18:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-03 23:18:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 248. [2025-03-03 23:18:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 199 states have (on average 1.1306532663316582) internal successors, (225), 199 states have internal predecessors, (225), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:18:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 309 transitions. [2025-03-03 23:18:09,996 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 309 transitions. Word has length 121 [2025-03-03 23:18:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:09,998 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 309 transitions. [2025-03-03 23:18:09,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 309 transitions. [2025-03-03 23:18:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 23:18:09,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:09,999 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:09,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 23:18:09,999 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:10,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1349249922, now seen corresponding path program 1 times [2025-03-03 23:18:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:10,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74980049] [2025-03-03 23:18:10,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:10,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 23:18:10,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 23:18:10,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:10,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-03 23:18:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74980049] [2025-03-03 23:18:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74980049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:10,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:18:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127063253] [2025-03-03 23:18:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:10,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:18:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:10,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:18:10,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:18:10,434 INFO L87 Difference]: Start difference. First operand 248 states and 309 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:10,531 INFO L93 Difference]: Finished difference Result 390 states and 478 transitions. [2025-03-03 23:18:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:18:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 121 [2025-03-03 23:18:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:10,533 INFO L225 Difference]: With dead ends: 390 [2025-03-03 23:18:10,533 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 23:18:10,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:18:10,533 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 67 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:10,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 137 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 23:18:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 241. [2025-03-03 23:18:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 192 states have (on average 1.1197916666666667) internal successors, (215), 192 states have internal predecessors, (215), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:18:10,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 299 transitions. [2025-03-03 23:18:10,553 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 299 transitions. Word has length 121 [2025-03-03 23:18:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:10,553 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 299 transitions. [2025-03-03 23:18:10,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 299 transitions. [2025-03-03 23:18:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 23:18:10,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:10,554 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:10,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 23:18:10,554 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:10,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2067176046, now seen corresponding path program 1 times [2025-03-03 23:18:10,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:10,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143045899] [2025-03-03 23:18:10,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:10,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:10,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 23:18:10,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 23:18:10,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:10,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 23:18:12,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:12,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143045899] [2025-03-03 23:18:12,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143045899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:18:12,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245812703] [2025-03-03 23:18:12,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:12,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:18:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:18:12,051 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-03 23:18:12,052 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-03 23:18:12,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 23:18:12,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 23:18:12,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:12,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:12,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 23:18:12,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:18:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-03 23:18:12,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:18:12,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245812703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:12,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:18:12,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 24 [2025-03-03 23:18:12,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127634530] [2025-03-03 23:18:12,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:12,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:18:12,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:12,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:18:12,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-03-03 23:18:12,293 INFO L87 Difference]: Start difference. First operand 241 states and 299 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:12,484 INFO L93 Difference]: Finished difference Result 374 states and 465 transitions. [2025-03-03 23:18:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:18:12,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2025-03-03 23:18:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:12,488 INFO L225 Difference]: With dead ends: 374 [2025-03-03 23:18:12,488 INFO L226 Difference]: Without dead ends: 372 [2025-03-03 23:18:12,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-03-03 23:18:12,489 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 94 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:12,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 382 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-03 23:18:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 243. [2025-03-03 23:18:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 194 states have (on average 1.1237113402061856) internal successors, (218), 194 states have internal predecessors, (218), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:18:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 302 transitions. [2025-03-03 23:18:12,503 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 302 transitions. Word has length 122 [2025-03-03 23:18:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:12,504 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 302 transitions. [2025-03-03 23:18:12,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 302 transitions. [2025-03-03 23:18:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 23:18:12,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:12,505 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:12,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 23:18:12,706 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-03 23:18:12,706 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:12,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash 430839891, now seen corresponding path program 1 times [2025-03-03 23:18:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:12,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009802653] [2025-03-03 23:18:12,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:12,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:12,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 23:18:12,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 23:18:12,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:12,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-03 23:18:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:12,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009802653] [2025-03-03 23:18:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009802653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:12,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:12,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:18:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738355963] [2025-03-03 23:18:12,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:12,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:18:12,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:12,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:18:12,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:18:12,942 INFO L87 Difference]: Start difference. First operand 243 states and 302 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:13,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:13,103 INFO L93 Difference]: Finished difference Result 394 states and 480 transitions. [2025-03-03 23:18:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:18:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2025-03-03 23:18:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:13,105 INFO L225 Difference]: With dead ends: 394 [2025-03-03 23:18:13,105 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 23:18:13,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:18:13,106 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 39 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:13,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 227 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 23:18:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 247. [2025-03-03 23:18:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 198 states have (on average 1.1262626262626263) internal successors, (223), 198 states have internal predecessors, (223), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:18:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2025-03-03 23:18:13,123 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 122 [2025-03-03 23:18:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:13,124 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2025-03-03 23:18:13,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2025-03-03 23:18:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 23:18:13,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:13,125 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:13,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 23:18:13,126 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:13,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1021876405, now seen corresponding path program 1 times [2025-03-03 23:18:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:13,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226649877] [2025-03-03 23:18:13,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:13,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 23:18:13,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 23:18:13,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:13,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-03-03 23:18:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226649877] [2025-03-03 23:18:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226649877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:13,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:13,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:18:13,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404831055] [2025-03-03 23:18:13,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:13,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:18:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:13,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:18:13,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:18:13,163 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:13,198 INFO L93 Difference]: Finished difference Result 352 states and 437 transitions. [2025-03-03 23:18:13,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:18:13,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2025-03-03 23:18:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:13,200 INFO L225 Difference]: With dead ends: 352 [2025-03-03 23:18:13,200 INFO L226 Difference]: Without dead ends: 250 [2025-03-03 23:18:13,200 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-03 23:18:13,201 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:13,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 127 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:18:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-03 23:18:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 235. [2025-03-03 23:18:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 186 states have (on average 1.118279569892473) internal successors, (208), 186 states have internal predecessors, (208), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:18:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 292 transitions. [2025-03-03 23:18:13,215 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 292 transitions. Word has length 122 [2025-03-03 23:18:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:13,217 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 292 transitions. [2025-03-03 23:18:13,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 292 transitions. [2025-03-03 23:18:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 23:18:13,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:13,218 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:13,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 23:18:13,218 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:13,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:13,218 INFO L85 PathProgramCache]: Analyzing trace with hash 79841524, now seen corresponding path program 1 times [2025-03-03 23:18:13,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305920947] [2025-03-03 23:18:13,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:13,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:18:13,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:18:13,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:13,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 23:18:16,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:16,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305920947] [2025-03-03 23:18:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305920947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:18:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290904662] [2025-03-03 23:18:16,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:16,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:18:16,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:18:16,874 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-03 23:18:16,875 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-03 23:18:16,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:18:16,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:18:16,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:16,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:16,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:18:16,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:18:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-03 23:18:17,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:18:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290904662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:17,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:18:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [22] total 29 [2025-03-03 23:18:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613233944] [2025-03-03 23:18:17,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:17,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:18:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:17,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:18:17,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2025-03-03 23:18:17,207 INFO L87 Difference]: Start difference. First operand 235 states and 292 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:17,423 INFO L93 Difference]: Finished difference Result 394 states and 484 transitions. [2025-03-03 23:18:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:18:17,427 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2025-03-03 23:18:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:17,429 INFO L225 Difference]: With dead ends: 394 [2025-03-03 23:18:17,429 INFO L226 Difference]: Without dead ends: 392 [2025-03-03 23:18:17,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2025-03-03 23:18:17,431 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 86 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:17,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 483 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-03 23:18:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 231. [2025-03-03 23:18:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 182 states have (on average 1.10989010989011) internal successors, (202), 182 states have internal predecessors, (202), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:18:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2025-03-03 23:18:17,447 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 123 [2025-03-03 23:18:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:17,447 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2025-03-03 23:18:17,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2025-03-03 23:18:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 23:18:17,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:17,450 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:17,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 23:18:17,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 23:18:17,651 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:17,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:17,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1717109835, now seen corresponding path program 1 times [2025-03-03 23:18:17,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:17,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141763733] [2025-03-03 23:18:17,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:17,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:17,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:18:17,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:18:17,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:17,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 23:18:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141763733] [2025-03-03 23:18:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141763733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:18:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896154303] [2025-03-03 23:18:18,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:18,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:18:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:18:18,427 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-03 23:18:18,427 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-03 23:18:18,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 23:18:18,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 23:18:18,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:18,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:18,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 23:18:18,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:18:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-03 23:18:20,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:18:20,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896154303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:20,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:18:20,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2025-03-03 23:18:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394983947] [2025-03-03 23:18:20,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:20,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:18:20,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:20,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:18:20,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-03 23:18:20,061 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:20,452 INFO L93 Difference]: Finished difference Result 336 states and 409 transitions. [2025-03-03 23:18:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:18:20,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2025-03-03 23:18:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:20,454 INFO L225 Difference]: With dead ends: 336 [2025-03-03 23:18:20,454 INFO L226 Difference]: Without dead ends: 334 [2025-03-03 23:18:20,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-03-03 23:18:20,455 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 64 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:20,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 594 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:18:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-03 23:18:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 191. [2025-03-03 23:18:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.12) internal successors, (168), 150 states have internal predecessors, (168), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 23:18:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 238 transitions. [2025-03-03 23:18:20,469 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 238 transitions. Word has length 123 [2025-03-03 23:18:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:20,469 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 238 transitions. [2025-03-03 23:18:20,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 238 transitions. [2025-03-03 23:18:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 23:18:20,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:18:20,470 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:18:20,476 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-03 23:18:20,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:18:20,674 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:18:20,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:18:20,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1755770761, now seen corresponding path program 1 times [2025-03-03 23:18:20,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:18:20,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046035450] [2025-03-03 23:18:20,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:18:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:18:20,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 23:18:20,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 23:18:20,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:18:20,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:18:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-03 23:18:20,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:18:20,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046035450] [2025-03-03 23:18:20,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046035450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:18:20,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:18:20,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:18:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73811769] [2025-03-03 23:18:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:18:20,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:18:20,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:18:20,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:18:20,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:18:20,889 INFO L87 Difference]: Start difference. First operand 191 states and 238 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:18:21,073 INFO L93 Difference]: Finished difference Result 440 states and 544 transitions. [2025-03-03 23:18:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:18:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 124 [2025-03-03 23:18:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:18:21,075 INFO L225 Difference]: With dead ends: 440 [2025-03-03 23:18:21,075 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 23:18:21,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:18:21,076 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 89 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:18:21,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 165 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:18:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 23:18:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 23:18:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 23:18:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 23:18:21,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2025-03-03 23:18:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:18:21,077 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 23:18:21,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 23:18:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 23:18:21,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 23:18:21,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:18:21,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 23:18:21,081 INFO L422 BasicCegarLoop]: Path program histogram: [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-03 23:18:21,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 23:18:21,395 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:18:21,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:18:21 BoogieIcfgContainer [2025-03-03 23:18:21,401 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:18:21,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:18:21,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:18:21,402 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:18:21,402 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:17:59" (3/4) ... [2025-03-03 23:18:21,404 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 23:18:21,408 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-03 23:18:21,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-03 23:18:21,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 23:18:21,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 23:18:21,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 23:18:21,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 23:18:21,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 23:18:21,472 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:18:21,473 INFO L158 Benchmark]: Toolchain (without parser) took 22659.26ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 112.8MB in the beginning and 365.8MB in the end (delta: -253.0MB). Peak memory consumption was 309.2MB. Max. memory is 16.1GB. [2025-03-03 23:18:21,473 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:18:21,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.88ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:18:21,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.61ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:18:21,473 INFO L158 Benchmark]: Boogie Preprocessor took 39.81ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 96.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:18:21,473 INFO L158 Benchmark]: IcfgBuilder took 314.56ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 78.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:18:21,474 INFO L158 Benchmark]: TraceAbstraction took 21969.69ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 78.4MB in the beginning and 370.1MB in the end (delta: -291.7MB). Peak memory consumption was 267.2MB. Max. memory is 16.1GB. [2025-03-03 23:18:21,474 INFO L158 Benchmark]: Witness Printer took 70.43ms. Allocated memory is still 704.6MB. Free memory was 370.1MB in the beginning and 365.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:18:21,475 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.88ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.61ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.81ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 96.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 314.56ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 78.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21969.69ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 78.4MB in the beginning and 370.1MB in the end (delta: -291.7MB). Peak memory consumption was 267.2MB. Max. memory is 16.1GB. * Witness Printer took 70.43ms. Allocated memory is still 704.6MB. Free memory was 370.1MB in the beginning and 365.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 24, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1522 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1522 mSDsluCounter, 5687 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4146 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2808 IncrementalHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 1541 mSDtfsCounter, 2808 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 920 GetRequests, 711 SyntacticMatches, 1 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=17, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 1148 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 2902 NumberOfCodeBlocks, 2902 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2872 ConstructedInterpolants, 0 QuantifiedInterpolants, 15572 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1497 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 7944/8078 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 23:18:21,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE