./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 03:36:40,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:36:40,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:36:40,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:36:40,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:36:40,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:36:40,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:36:40,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:36:40,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:36:40,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:36:40,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:36:40,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:36:40,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:36:40,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:36:40,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:36:40,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:40,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:36:40,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:36:40,506 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-17 03:36:40,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:36:40,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:36:40,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:36:40,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:36:40,776 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:36:40,777 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-17 03:36:41,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96cc208f6/a444a3b83f6e4613ad49432d50650a0c/FLAG09f0fb78b [2025-03-17 03:36:42,109 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:36:42,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2025-03-17 03:36:42,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96cc208f6/a444a3b83f6e4613ad49432d50650a0c/FLAG09f0fb78b [2025-03-17 03:36:42,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96cc208f6/a444a3b83f6e4613ad49432d50650a0c [2025-03-17 03:36:42,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:36:42,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:36:42,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:42,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:36:42,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:36:42,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1820d560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42, skipping insertion in model container [2025-03-17 03:36:42,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:36:42,236 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-17 03:36:42,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:42,269 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:36:42,279 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-17 03:36:42,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:42,300 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:36:42,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42 WrapperNode [2025-03-17 03:36:42,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:42,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:42,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:36:42,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:36:42,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,331 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-17 03:36:42,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:42,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:36:42,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:36:42,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:36:42,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,352 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-17 03:36:42,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:36:42,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:36:42,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:36:42,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:36:42,362 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (1/1) ... [2025-03-17 03:36:42,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:42,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:42,391 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-17 03:36:42,396 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-17 03:36:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:36:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:36:42,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:36:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:36:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:36:42,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:36:42,461 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:36:42,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:36:42,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: havoc property_#t~bitwise10#1;havoc property_#t~short11#1; [2025-03-17 03:36:42,627 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:36:42,628 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:36:42,642 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:36:42,642 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:36:42,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:42 BoogieIcfgContainer [2025-03-17 03:36:42,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:36:42,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:36:42,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:36:42,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:36:42,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:36:42" (1/3) ... [2025-03-17 03:36:42,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97f6ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:42, skipping insertion in model container [2025-03-17 03:36:42,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:42" (2/3) ... [2025-03-17 03:36:42,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97f6ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:42, skipping insertion in model container [2025-03-17 03:36:42,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:42" (3/3) ... [2025-03-17 03:36:42,649 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-22.i [2025-03-17 03:36:42,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:36:42,660 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-22.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:36:42,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:36:42,711 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;@2893a540, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:36:42,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:36:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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-17 03:36:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 03:36:42,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:42,719 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] [2025-03-17 03:36:42,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:42,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:42,723 INFO L85 PathProgramCache]: Analyzing trace with hash 37104629, now seen corresponding path program 1 times [2025-03-17 03:36:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:42,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170815116] [2025-03-17 03:36:42,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:42,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 03:36:42,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 03:36:42,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:42,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:42,847 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-17 03:36:42,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170815116] [2025-03-17 03:36:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170815116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:36:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541770814] [2025-03-17 03:36:42,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:42,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:42,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:42,852 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-17 03:36:42,853 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-17 03:36:42,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 03:36:42,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 03:36:42,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:42,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:42,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:36:42,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:42,969 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-17 03:36:42,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:36:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541770814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:36:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:36:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653361645] [2025-03-17 03:36:42,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:42,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:36:42,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:42,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:36:42,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:42,991 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-17 03:36:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:43,003 INFO L93 Difference]: Finished difference Result 81 states and 127 transitions. [2025-03-17 03:36:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:36:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 55 [2025-03-17 03:36:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:43,010 INFO L225 Difference]: With dead ends: 81 [2025-03-17 03:36:43,011 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 03:36:43,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-17 03:36:43,016 INFO L435 NwaCegarLoop]: 53 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, 53 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-17 03:36:43,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:36:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 03:36:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 03:36:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-17 03:36:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2025-03-17 03:36:43,050 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 55 [2025-03-17 03:36:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:43,051 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-03-17 03:36:43,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-17 03:36:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2025-03-17 03:36:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 03:36:43,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:43,052 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] [2025-03-17 03:36:43,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:36:43,253 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-17 03:36:43,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:43,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:43,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1237246215, now seen corresponding path program 1 times [2025-03-17 03:36:43,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:43,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047129818] [2025-03-17 03:36:43,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:43,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:43,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 03:36:43,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 03:36:43,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:43,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:43,719 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-17 03:36:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047129818] [2025-03-17 03:36:43,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047129818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:43,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:43,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:36:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326151384] [2025-03-17 03:36:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:43,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:36:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:43,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:36:43,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:36:43,724 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-17 03:36:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:43,873 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2025-03-17 03:36:43,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:36:43,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 55 [2025-03-17 03:36:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:43,875 INFO L225 Difference]: With dead ends: 136 [2025-03-17 03:36:43,876 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 03:36:43,877 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-17 03:36:43,877 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 100 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:43,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 153 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:36:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 03:36:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2025-03-17 03:36:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 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-17 03:36:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2025-03-17 03:36:43,896 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 55 [2025-03-17 03:36:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:43,896 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2025-03-17 03:36:43,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-17 03:36:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2025-03-17 03:36:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 03:36:43,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:43,898 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] [2025-03-17 03:36:43,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:36:43,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:43,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1744959247, now seen corresponding path program 1 times [2025-03-17 03:36:43,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:43,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926160674] [2025-03-17 03:36:43,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:43,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 03:36:43,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 03:36:43,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:43,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:44,061 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-17 03:36:44,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926160674] [2025-03-17 03:36:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926160674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:44,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:44,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:36:44,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608783253] [2025-03-17 03:36:44,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:44,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:36:44,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:44,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:36:44,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:36:44,062 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 03:36:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:44,162 INFO L93 Difference]: Finished difference Result 131 states and 179 transitions. [2025-03-17 03:36:44,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:36:44,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 56 [2025-03-17 03:36:44,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:44,164 INFO L225 Difference]: With dead ends: 131 [2025-03-17 03:36:44,164 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 03:36:44,164 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-17 03:36:44,165 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 50 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 142 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-17 03:36:44,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 142 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:36:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 03:36:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 57. [2025-03-17 03:36:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 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-17 03:36:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2025-03-17 03:36:44,180 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 56 [2025-03-17 03:36:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:44,180 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2025-03-17 03:36:44,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 03:36:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2025-03-17 03:36:44,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 03:36:44,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:44,181 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] [2025-03-17 03:36:44,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:36:44,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:44,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash -28202167, now seen corresponding path program 1 times [2025-03-17 03:36:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:44,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656387557] [2025-03-17 03:36:44,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:44,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 03:36:44,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 03:36:44,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:44,405 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-17 03:36:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656387557] [2025-03-17 03:36:44,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656387557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:44,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:44,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:36:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658324364] [2025-03-17 03:36:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:44,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:36:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:44,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:36:44,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:36:44,407 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-17 03:36:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:44,564 INFO L93 Difference]: Finished difference Result 187 states and 249 transitions. [2025-03-17 03:36:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:36:44,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 56 [2025-03-17 03:36:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:44,565 INFO L225 Difference]: With dead ends: 187 [2025-03-17 03:36:44,566 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 03:36:44,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-17 03:36:44,567 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 203 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-17 03:36:44,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 203 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:36:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 03:36:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 112. [2025-03-17 03:36:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 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-17 03:36:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 153 transitions. [2025-03-17 03:36:44,589 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 153 transitions. Word has length 56 [2025-03-17 03:36:44,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:44,589 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 153 transitions. [2025-03-17 03:36:44,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-17 03:36:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 153 transitions. [2025-03-17 03:36:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 03:36:44,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:44,590 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] [2025-03-17 03:36:44,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:36:44,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:44,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash -321605174, now seen corresponding path program 1 times [2025-03-17 03:36:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:44,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257326246] [2025-03-17 03:36:44,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:44,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 03:36:44,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 03:36:44,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:44,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:44,627 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-17 03:36:44,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:44,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257326246] [2025-03-17 03:36:44,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257326246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:44,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:44,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:36:44,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855342984] [2025-03-17 03:36:44,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:44,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:36:44,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:44,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:36:44,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:36:44,630 INFO L87 Difference]: Start difference. First operand 112 states and 153 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 03:36:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:44,653 INFO L93 Difference]: Finished difference Result 179 states and 242 transitions. [2025-03-17 03:36:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:36:44,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 56 [2025-03-17 03:36:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:44,657 INFO L225 Difference]: With dead ends: 179 [2025-03-17 03:36:44,657 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 03:36:44,657 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-17 03:36:44,657 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 113 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-17 03:36:44,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:36:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 03:36:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2025-03-17 03:36:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 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-17 03:36:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2025-03-17 03:36:44,682 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 56 [2025-03-17 03:36:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:44,682 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2025-03-17 03:36:44,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 03:36:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2025-03-17 03:36:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 03:36:44,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:44,683 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] [2025-03-17 03:36:44,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:36:44,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:44,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 570619071, now seen corresponding path program 1 times [2025-03-17 03:36:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:44,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576374204] [2025-03-17 03:36:44,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:44,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:44,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 03:36:44,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 03:36:44,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:44,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:45,344 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-17 03:36:45,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:45,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576374204] [2025-03-17 03:36:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576374204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:36:45,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303828397] [2025-03-17 03:36:45,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:45,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:36:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:45,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:36:45,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:36:45,346 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-17 03:36:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:45,600 INFO L93 Difference]: Finished difference Result 331 states and 442 transitions. [2025-03-17 03:36:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:36:45,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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 57 [2025-03-17 03:36:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:45,602 INFO L225 Difference]: With dead ends: 331 [2025-03-17 03:36:45,602 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 03:36:45,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:36:45,606 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 207 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:45,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 376 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:36:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 03:36:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 107. [2025-03-17 03:36:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 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-17 03:36:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2025-03-17 03:36:45,624 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 57 [2025-03-17 03:36:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:45,625 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2025-03-17 03:36:45,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-17 03:36:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2025-03-17 03:36:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 03:36:45,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:45,626 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] [2025-03-17 03:36:45,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:36:45,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:45,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1530653157, now seen corresponding path program 1 times [2025-03-17 03:36:45,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:45,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035944512] [2025-03-17 03:36:45,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:45,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:45,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 03:36:45,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 03:36:45,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:45,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:45,671 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-17 03:36:45,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:45,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035944512] [2025-03-17 03:36:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035944512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:45,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:45,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:36:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983565886] [2025-03-17 03:36:45,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:45,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:36:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:45,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:36:45,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:36:45,673 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-17 03:36:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:45,736 INFO L93 Difference]: Finished difference Result 269 states and 362 transitions. [2025-03-17 03:36:45,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:36:45,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 57 [2025-03-17 03:36:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:45,739 INFO L225 Difference]: With dead ends: 269 [2025-03-17 03:36:45,740 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 03:36:45,740 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-17 03:36:45,741 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 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-17 03:36:45,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:36:45,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 03:36:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2025-03-17 03:36:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 138 states have internal predecessors, (169), 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-17 03:36:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 239 transitions. [2025-03-17 03:36:45,770 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 239 transitions. Word has length 57 [2025-03-17 03:36:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:45,770 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 239 transitions. [2025-03-17 03:36:45,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-17 03:36:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 239 transitions. [2025-03-17 03:36:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 03:36:45,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:45,771 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-17 03:36:45,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:36:45,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:45,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1239278637, now seen corresponding path program 1 times [2025-03-17 03:36:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:45,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113221735] [2025-03-17 03:36:45,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:45,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 03:36:45,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 03:36:45,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:45,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:46,354 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-17 03:36:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113221735] [2025-03-17 03:36:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113221735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:46,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:46,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:36:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743654132] [2025-03-17 03:36:46,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:46,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:36:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:46,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:36:46,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:36:46,357 INFO L87 Difference]: Start difference. First operand 179 states and 239 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-17 03:36:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:46,555 INFO L93 Difference]: Finished difference Result 331 states and 435 transitions. [2025-03-17 03:36:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:36:46,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-17 03:36:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:46,556 INFO L225 Difference]: With dead ends: 331 [2025-03-17 03:36:46,559 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 03:36:46,559 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-17 03:36:46,559 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:46,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 152 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:36:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 03:36:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 196. [2025-03-17 03:36:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 1.232258064516129) internal successors, (191), 155 states have internal predecessors, (191), 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-17 03:36:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 261 transitions. [2025-03-17 03:36:46,586 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 261 transitions. Word has length 58 [2025-03-17 03:36:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:46,586 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 261 transitions. [2025-03-17 03:36:46,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-17 03:36:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 261 transitions. [2025-03-17 03:36:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 03:36:46,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:46,589 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-17 03:36:46,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:36:46,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:46,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1368361356, now seen corresponding path program 1 times [2025-03-17 03:36:46,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:46,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031075191] [2025-03-17 03:36:46,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:46,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:46,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 03:36:46,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 03:36:46,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:46,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:46,625 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-17 03:36:46,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031075191] [2025-03-17 03:36:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031075191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:46,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:46,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:36:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747254810] [2025-03-17 03:36:46,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:46,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:36:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:46,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:36:46,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:36:46,627 INFO L87 Difference]: Start difference. First operand 196 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 03:36:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:46,660 INFO L93 Difference]: Finished difference Result 332 states and 442 transitions. [2025-03-17 03:36:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:36:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 03:36:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:46,662 INFO L225 Difference]: With dead ends: 332 [2025-03-17 03:36:46,662 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 03:36:46,662 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-17 03:36:46,663 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 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-17 03:36:46,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:36:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 03:36:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2025-03-17 03:36:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 108 states have internal predecessors, (128), 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-17 03:36:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2025-03-17 03:36:46,674 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 58 [2025-03-17 03:36:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:46,674 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2025-03-17 03:36:46,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 03:36:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2025-03-17 03:36:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 03:36:46,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:46,675 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-17 03:36:46,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:36:46,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:46,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash 184435400, now seen corresponding path program 1 times [2025-03-17 03:36:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:46,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812959679] [2025-03-17 03:36:46,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:46,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 03:36:46,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 03:36:46,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:46,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:47,102 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-17 03:36:47,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:47,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812959679] [2025-03-17 03:36:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812959679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:47,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:36:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462102003] [2025-03-17 03:36:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:47,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:36:47,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:47,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:36:47,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:36:47,104 INFO L87 Difference]: Start difference. First operand 141 states and 184 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-17 03:36:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:47,587 INFO L93 Difference]: Finished difference Result 262 states and 340 transitions. [2025-03-17 03:36:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 03:36:47,588 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-17 03:36:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:47,589 INFO L225 Difference]: With dead ends: 262 [2025-03-17 03:36:47,589 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 03:36:47,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:36:47,590 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 161 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:47,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 402 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:36:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 03:36:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 203. [2025-03-17 03:36:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 162 states have internal predecessors, (195), 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-17 03:36:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2025-03-17 03:36:47,610 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 60 [2025-03-17 03:36:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:47,610 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2025-03-17 03:36:47,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-17 03:36:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2025-03-17 03:36:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 03:36:47,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:47,612 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-17 03:36:47,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 03:36:47,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:47,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash 163247258, now seen corresponding path program 1 times [2025-03-17 03:36:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:47,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6909806] [2025-03-17 03:36:47,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:47,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:47,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 03:36:47,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 03:36:47,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:47,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:48,008 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-17 03:36:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6909806] [2025-03-17 03:36:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6909806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:48,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:48,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:36:48,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545090091] [2025-03-17 03:36:48,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:48,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:36:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:48,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:36:48,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:36:48,013 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-17 03:36:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:48,198 INFO L93 Difference]: Finished difference Result 212 states and 274 transitions. [2025-03-17 03:36:48,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:36:48,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-17 03:36:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:48,200 INFO L225 Difference]: With dead ends: 212 [2025-03-17 03:36:48,200 INFO L226 Difference]: Without dead ends: 210 [2025-03-17 03:36:48,200 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-17 03:36:48,201 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 387 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-17 03:36:48,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 387 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:36:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-17 03:36:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2025-03-17 03:36:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 162 states have internal predecessors, (194), 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-17 03:36:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2025-03-17 03:36:48,218 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 61 [2025-03-17 03:36:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:48,219 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2025-03-17 03:36:48,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-17 03:36:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2025-03-17 03:36:48,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 03:36:48,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:48,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:48,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 03:36:48,220 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:48,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash -42063158, now seen corresponding path program 1 times [2025-03-17 03:36:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:48,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444254229] [2025-03-17 03:36:48,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:48,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 03:36:48,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 03:36:48,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:48,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:36:48,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444254229] [2025-03-17 03:36:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444254229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:36:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669353597] [2025-03-17 03:36:48,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:48,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:48,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:48,732 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-17 03:36:48,734 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-17 03:36:48,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 03:36:48,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 03:36:48,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:48,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:48,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 03:36:48,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 7 proven. 214 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-17 03:36:49,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:36:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:36:51,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669353597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:36:51,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:36:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2025-03-17 03:36:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209295829] [2025-03-17 03:36:51,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:36:51,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 03:36:51,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:51,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 03:36:51,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:36:51,953 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-17 03:36:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:55,844 INFO L93 Difference]: Finished difference Result 1373 states and 1707 transitions. [2025-03-17 03:36:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-17 03:36:55,844 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 114 [2025-03-17 03:36:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:55,849 INFO L225 Difference]: With dead ends: 1373 [2025-03-17 03:36:55,849 INFO L226 Difference]: Without dead ends: 1226 [2025-03-17 03:36:55,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2710 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1324, Invalid=5986, Unknown=0, NotChecked=0, Total=7310 [2025-03-17 03:36:55,852 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1187 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:55,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1314 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 03:36:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-17 03:36:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 577. [2025-03-17 03:36:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 456 states have (on average 1.1754385964912282) internal successors, (536), 456 states have internal predecessors, (536), 105 states have call successors, (105), 15 states have call predecessors, (105), 15 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 03:36:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 746 transitions. [2025-03-17 03:36:55,907 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 746 transitions. Word has length 114 [2025-03-17 03:36:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:55,907 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 746 transitions. [2025-03-17 03:36:55,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-17 03:36:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 746 transitions. [2025-03-17 03:36:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:36:55,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:55,909 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] [2025-03-17 03:36:55,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:36:56,109 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,SelfDestructingSolverStorable11 [2025-03-17 03:36:56,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:56,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash 140928350, now seen corresponding path program 1 times [2025-03-17 03:36:56,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:56,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43968895] [2025-03-17 03:36:56,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:56,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:36:56,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:36:56,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:56,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:36:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:57,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43968895] [2025-03-17 03:36:57,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43968895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:36:57,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187729535] [2025-03-17 03:36:57,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:57,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:57,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:57,042 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-17 03:36:57,044 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-17 03:36:57,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:36:57,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:36:57,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:57,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:57,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 03:36:57,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 03:36:57,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:36:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187729535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:57,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:36:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2025-03-17 03:36:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215743454] [2025-03-17 03:36:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:57,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:36:57,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:57,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:36:57,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:36:57,527 INFO L87 Difference]: Start difference. First operand 577 states and 746 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-17 03:36:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:57,662 INFO L93 Difference]: Finished difference Result 1110 states and 1432 transitions. [2025-03-17 03:36:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:36:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 115 [2025-03-17 03:36:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:57,668 INFO L225 Difference]: With dead ends: 1110 [2025-03-17 03:36:57,668 INFO L226 Difference]: Without dead ends: 679 [2025-03-17 03:36:57,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:36:57,670 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:57,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 178 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:36:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-17 03:36:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 568. [2025-03-17 03:36:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 447 states have (on average 1.174496644295302) internal successors, (525), 447 states have internal predecessors, (525), 105 states have call successors, (105), 15 states have call predecessors, (105), 15 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 03:36:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 735 transitions. [2025-03-17 03:36:57,714 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 735 transitions. Word has length 115 [2025-03-17 03:36:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:57,714 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 735 transitions. [2025-03-17 03:36:57,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-17 03:36:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 735 transitions. [2025-03-17 03:36:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 03:36:57,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:57,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:57,722 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-17 03:36:57,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:57,916 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:57,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1247167366, now seen corresponding path program 1 times [2025-03-17 03:36:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:57,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383005605] [2025-03-17 03:36:57,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:57,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 03:36:57,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 03:36:57,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:57,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:36:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:58,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383005605] [2025-03-17 03:36:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383005605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:36:58,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602669697] [2025-03-17 03:36:58,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:58,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:58,481 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-17 03:36:58,482 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-17 03:36:58,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 03:36:58,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 03:36:58,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:58,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:58,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 03:36:58,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 55 proven. 233 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-17 03:36:59,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:37:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 03:37:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602669697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:37:01,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:37:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 10] total 27 [2025-03-17 03:37:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950350760] [2025-03-17 03:37:01,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:37:01,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 03:37:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:37:01,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 03:37:01,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-03-17 03:37:01,106 INFO L87 Difference]: Start difference. First operand 568 states and 735 transitions. Second operand has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 26 states have internal predecessors, (134), 8 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) [2025-03-17 03:37:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:02,947 INFO L93 Difference]: Finished difference Result 1717 states and 2151 transitions. [2025-03-17 03:37:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-17 03:37:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 26 states have internal predecessors, (134), 8 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) Word has length 116 [2025-03-17 03:37:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:02,954 INFO L225 Difference]: With dead ends: 1717 [2025-03-17 03:37:02,954 INFO L226 Difference]: Without dead ends: 1394 [2025-03-17 03:37:02,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1631, Invalid=4531, Unknown=0, NotChecked=0, Total=6162 [2025-03-17 03:37:02,958 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1114 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:37:02,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1164 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:37:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-17 03:37:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2025-03-17 03:37:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 611 states have (on average 1.160392798690671) internal successors, (709), 611 states have internal predecessors, (709), 147 states have call successors, (147), 33 states have call predecessors, (147), 33 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-17 03:37:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1003 transitions. [2025-03-17 03:37:03,042 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1003 transitions. Word has length 116 [2025-03-17 03:37:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:03,043 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1003 transitions. [2025-03-17 03:37:03,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 26 states have internal predecessors, (134), 8 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) [2025-03-17 03:37:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1003 transitions. [2025-03-17 03:37:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 03:37:03,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:03,044 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] [2025-03-17 03:37:03,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 03:37:03,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:37:03,244 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:03,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:03,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1452368930, now seen corresponding path program 1 times [2025-03-17 03:37:03,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:37:03,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693911056] [2025-03-17 03:37:03,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:03,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:37:03,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 03:37:03,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 03:37:03,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:03,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:06,302 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-17 03:37:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:37:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693911056] [2025-03-17 03:37:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693911056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:37:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26515659] [2025-03-17 03:37:06,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:06,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:37:06,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:37:06,304 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-17 03:37:06,305 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-17 03:37:06,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 03:37:06,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 03:37:06,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:06,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:06,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:37:06,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:37:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 03:37:06,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:37:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26515659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:37:06,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:37:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2025-03-17 03:37:06,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655397971] [2025-03-17 03:37:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:37:06,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:37:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:37:06,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:37:06,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:37:06,657 INFO L87 Difference]: Start difference. First operand 792 states and 1003 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-17 03:37:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:06,798 INFO L93 Difference]: Finished difference Result 1303 states and 1649 transitions. [2025-03-17 03:37:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:37:06,798 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 117 [2025-03-17 03:37:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:06,802 INFO L225 Difference]: With dead ends: 1303 [2025-03-17 03:37:06,802 INFO L226 Difference]: Without dead ends: 787 [2025-03-17 03:37:06,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 03:37:06,805 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:37:06,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 159 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:37:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-17 03:37:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 729. [2025-03-17 03:37:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 548 states have (on average 1.1277372262773722) internal successors, (618), 548 states have internal predecessors, (618), 147 states have call successors, (147), 33 states have call predecessors, (147), 33 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-17 03:37:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 912 transitions. [2025-03-17 03:37:06,867 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 912 transitions. Word has length 117 [2025-03-17 03:37:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:06,867 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 912 transitions. [2025-03-17 03:37:06,867 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-17 03:37:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 912 transitions. [2025-03-17 03:37:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 03:37:06,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:06,869 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] [2025-03-17 03:37:06,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 03:37:07,070 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,SelfDestructingSolverStorable14 [2025-03-17 03:37:07,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:07,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1729291831, now seen corresponding path program 1 times [2025-03-17 03:37:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:37:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687853411] [2025-03-17 03:37:07,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:37:07,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 03:37:07,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 03:37:07,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:07,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:37:08,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:37:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687853411] [2025-03-17 03:37:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687853411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:37:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24580300] [2025-03-17 03:37:08,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:08,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:37:08,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:37:08,312 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-17 03:37:08,314 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-17 03:37:08,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 03:37:08,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 03:37:08,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:08,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:08,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 03:37:08,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:37:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 03:37:09,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:37:09,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24580300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:37:09,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:37:09,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2025-03-17 03:37:09,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417171406] [2025-03-17 03:37:09,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:37:09,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:37:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:37:09,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:37:09,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:37:09,414 INFO L87 Difference]: Start difference. First operand 729 states and 912 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 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-17 03:37:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:09,829 INFO L93 Difference]: Finished difference Result 881 states and 1094 transitions. [2025-03-17 03:37:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:37:09,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 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 118 [2025-03-17 03:37:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:09,833 INFO L225 Difference]: With dead ends: 881 [2025-03-17 03:37:09,833 INFO L226 Difference]: Without dead ends: 879 [2025-03-17 03:37:09,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-03-17 03:37:09,834 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:37:09,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 488 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:37:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-17 03:37:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 746. [2025-03-17 03:37:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 565 states have (on average 1.1238938053097345) internal successors, (635), 565 states have internal predecessors, (635), 147 states have call successors, (147), 33 states have call predecessors, (147), 33 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-17 03:37:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 929 transitions. [2025-03-17 03:37:09,894 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 929 transitions. Word has length 118 [2025-03-17 03:37:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:09,895 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 929 transitions. [2025-03-17 03:37:09,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 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-17 03:37:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 929 transitions. [2025-03-17 03:37:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 03:37:09,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:09,898 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] [2025-03-17 03:37:09,904 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-17 03:37:10,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 03:37:10,098 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:10,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash 768724106, now seen corresponding path program 1 times [2025-03-17 03:37:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:37:10,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037788340] [2025-03-17 03:37:10,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:37:10,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 03:37:10,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 03:37:10,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:10,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 03:37:10,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:37:10,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037788340] [2025-03-17 03:37:10,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037788340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:37:10,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:37:10,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:37:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748042141] [2025-03-17 03:37:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:37:10,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:37:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:37:10,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:37:10,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:37:10,309 INFO L87 Difference]: Start difference. First operand 746 states and 929 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-17 03:37:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:10,489 INFO L93 Difference]: Finished difference Result 1333 states and 1661 transitions. [2025-03-17 03:37:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:37:10,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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 118 [2025-03-17 03:37:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:10,493 INFO L225 Difference]: With dead ends: 1333 [2025-03-17 03:37:10,494 INFO L226 Difference]: Without dead ends: 749 [2025-03-17 03:37:10,495 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-17 03:37:10,496 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 39 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:37:10,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 183 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:37:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-17 03:37:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 687. [2025-03-17 03:37:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 524 states have (on average 1.118320610687023) internal successors, (586), 524 states have internal predecessors, (586), 133 states have call successors, (133), 29 states have call predecessors, (133), 29 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-17 03:37:10,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 852 transitions. [2025-03-17 03:37:10,553 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 852 transitions. Word has length 118 [2025-03-17 03:37:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:10,556 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 852 transitions. [2025-03-17 03:37:10,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-17 03:37:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 852 transitions. [2025-03-17 03:37:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 03:37:10,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:10,557 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] [2025-03-17 03:37:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 03:37:10,558 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1964317594, now seen corresponding path program 1 times [2025-03-17 03:37:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:37:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740704842] [2025-03-17 03:37:10,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:10,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:37:10,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 03:37:10,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 03:37:10,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:10,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:37:11,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:37:11,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740704842] [2025-03-17 03:37:11,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740704842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:37:11,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973090708] [2025-03-17 03:37:11,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:11,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:37:11,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:37:11,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:37:11,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 03:37:11,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 03:37:11,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 03:37:11,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:11,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:11,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 03:37:11,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:37:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-17 03:37:13,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:37:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973090708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:37:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:37:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 26 [2025-03-17 03:37:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178455913] [2025-03-17 03:37:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:37:13,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:37:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:37:13,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:37:13,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2025-03-17 03:37:13,330 INFO L87 Difference]: Start difference. First operand 687 states and 852 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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-17 03:37:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:13,782 INFO L93 Difference]: Finished difference Result 841 states and 1041 transitions. [2025-03-17 03:37:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 03:37:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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-17 03:37:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:13,786 INFO L225 Difference]: With dead ends: 841 [2025-03-17 03:37:13,786 INFO L226 Difference]: Without dead ends: 839 [2025-03-17 03:37:13,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 03:37:13,787 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:37:13,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 554 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:37:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-03-17 03:37:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 674. [2025-03-17 03:37:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 511 states have (on average 1.1135029354207437) internal successors, (569), 511 states have internal predecessors, (569), 133 states have call successors, (133), 29 states have call predecessors, (133), 29 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-17 03:37:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 835 transitions. [2025-03-17 03:37:13,847 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 835 transitions. Word has length 119 [2025-03-17 03:37:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:13,847 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 835 transitions. [2025-03-17 03:37:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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-17 03:37:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 835 transitions. [2025-03-17 03:37:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 03:37:13,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:13,848 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] [2025-03-17 03:37:13,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 03:37:14,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:37:14,049 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:14,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash 167366235, now seen corresponding path program 1 times [2025-03-17 03:37:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:37:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766123473] [2025-03-17 03:37:14,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:14,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:37:14,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 03:37:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 03:37:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:37:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:37:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766123473] [2025-03-17 03:37:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766123473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:37:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787062485] [2025-03-17 03:37:14,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:37:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:37:14,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:37:14,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 03:37:14,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 03:37:14,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 03:37:14,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:14,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:14,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 03:37:14,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:37:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 03:37:15,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:37:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787062485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:37:15,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:37:15,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-03-17 03:37:15,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94060560] [2025-03-17 03:37:15,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:37:15,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:37:15,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:37:15,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:37:15,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-17 03:37:15,155 INFO L87 Difference]: Start difference. First operand 674 states and 835 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 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-17 03:37:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:15,351 INFO L93 Difference]: Finished difference Result 1189 states and 1480 transitions. [2025-03-17 03:37:15,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:37:15,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 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 119 [2025-03-17 03:37:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:15,352 INFO L225 Difference]: With dead ends: 1189 [2025-03-17 03:37:15,352 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 03:37:15,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:37:15,355 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 72 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:37:15,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 314 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:37:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 03:37:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 03:37:15,355 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-17 03:37:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 03:37:15,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2025-03-17 03:37:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:15,356 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 03:37:15,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 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-17 03:37:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 03:37:15,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 03:37:15,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:37:15,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 03:37:15,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:37:15,562 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] [2025-03-17 03:37:15,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 03:37:24,753 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 417 DAG size of output: 469 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 03:37:31,514 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:37:31,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:37:31 BoogieIcfgContainer [2025-03-17 03:37:31,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:37:31,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:37:31,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:37:31,530 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:37:31,532 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:42" (3/4) ... [2025-03-17 03:37:31,533 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 03:37:31,538 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 03:37:31,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 03:37:31,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 03:37:31,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 03:37:31,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 03:37:31,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 03:37:31,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 03:37:31,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:37:31,611 INFO L158 Benchmark]: Toolchain (without parser) took 49483.81ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 124.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2025-03-17 03:37:31,611 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:37:31,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.70ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 111.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:37:31,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.87ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:37:31,612 INFO L158 Benchmark]: Boogie Preprocessor took 29.65ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:37:31,613 INFO L158 Benchmark]: IcfgBuilder took 280.68ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 89.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:37:31,614 INFO L158 Benchmark]: TraceAbstraction took 48885.52ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 89.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 722.2MB. Max. memory is 16.1GB. [2025-03-17 03:37:31,614 INFO L158 Benchmark]: Witness Printer took 80.44ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:37:31,615 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.15ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.70ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 111.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.87ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.65ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 280.68ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 89.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 48885.52ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 89.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 722.2MB. Max. memory is 16.1GB. * Witness Printer took 80.44ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.5MB). 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, 43 locations, 69 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.9s, OverallIterations: 19, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3431 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3428 mSDsluCounter, 6503 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5252 mSDsCounter, 809 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5295 IncrementalHoareTripleChecker+Invalid, 6104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 809 mSolverCounterUnsat, 1251 mSDtfsCounter, 5295 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1459 GetRequests, 1120 SyntacticMatches, 4 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=792occurred in iteration=14, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 2163 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 2438 NumberOfCodeBlocks, 2438 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2639 ConstructedInterpolants, 0 QuantifiedInterpolants, 17825 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1984 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 6984/7658 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 - InvariantResult [Line: 86]: Location Invariant Derived location invariant: ((((((((((((7 < var_1_6) || (last_1_var_1_5 != 0)) && (var_1_4 != 0)) && (last_1_var_1_11 != last_1_var_1_5)) && (var_1_1 == var_1_5)) && (var_1_5 == var_1_11)) && ((var_1_6 < (last_1_var_1_5 + 8)) || (((65528 + var_1_6) % 65536) != 0))) && (last_1_var_1_5 == var_1_5)) && (last_1_var_1_5 <= 32767)) || (((((0 != var_1_5) && (((((var_1_1 + 17) <= 0) && (0 <= (var_1_1 + 32768))) || (((var_1_1 + 1) <= 0) && (0 <= (16 + var_1_1)))) || ((var_1_1 <= 32767) && (0 <= var_1_1)))) && (var_1_1 == var_1_11)) && (((var_1_6 == (var_1_5 + 8)) && ((last_1_var_1_5 + 8) <= var_1_6)) || ((var_1_6 <= (7 + last_1_var_1_5)) && (last_1_var_1_5 == var_1_5)))) && (var_1_4 <= 0))) || (((((var_1_1 != 0) && ((7 < var_1_6) || (last_1_var_1_5 != 0))) && (0 != var_1_5)) && ((var_1_6 < (last_1_var_1_5 + 8)) || (((65528 + var_1_6) % 65536) != 0))) && (((((var_1_1 + 17) <= 0) && (0 <= (var_1_1 + 32768))) || (((var_1_1 + 1) <= 0) && (0 <= (16 + var_1_1)))) || ((var_1_1 <= 32767) && (0 <= var_1_1))))) || (((((((((((long long) 65520 + last_1_var_1_11) % 65536) <= 32767) && (var_1_1 <= (((long long) 65520 + last_1_var_1_11) % 65536))) && (var_1_4 != 0)) && (last_1_var_1_5 != 0)) && (var_1_1 == var_1_11)) && (0 <= (var_1_1 + 32768))) && (((var_1_1 >= 0) ? (var_1_1 % 65536) : ((var_1_1 % 65536) + 65536)) == var_1_5)) && ((((long long) 65520 + last_1_var_1_11) % 65536) == var_1_5))) RESULT: Ultimate proved your program to be correct! [2025-03-17 03:37:31,644 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