./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label21.c -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 cf1785c72f46b71ff38ed18504aab74c5c60cda53bca8d196fb5a21f47b63a1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:36:05,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:36:05,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:36:05,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:36:05,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:36:05,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:36:05,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:36:05,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:36:05,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:36:05,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:36:05,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:36:05,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:36:05,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:36:05,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:36:05,253 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:36:05,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:36:05,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:36:05,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:36:05,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:36:05,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:36:05,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:36:05,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:36:05,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:36:05,255 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 -> cf1785c72f46b71ff38ed18504aab74c5c60cda53bca8d196fb5a21f47b63a1c [2025-03-03 10:36:05,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:36:05,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:36:05,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:36:05,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:36:05,481 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:36:05,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label21.c [2025-03-03 10:36:06,631 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d720163/fe347ddb1366489897c881d0e00df3e7/FLAG69d4fdb38 [2025-03-03 10:36:07,063 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:36:07,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label21.c [2025-03-03 10:36:07,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d720163/fe347ddb1366489897c881d0e00df3e7/FLAG69d4fdb38 [2025-03-03 10:36:07,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d720163/fe347ddb1366489897c881d0e00df3e7 [2025-03-03 10:36:07,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:36:07,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:36:07,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:36:07,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:36:07,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:36:07,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:07" (1/1) ... [2025-03-03 10:36:07,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7881b2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07, skipping insertion in model container [2025-03-03 10:36:07,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:07" (1/1) ... [2025-03-03 10:36:07,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:36:07,352 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/eca-rers2012/Problem12_label21.c[3054,3067] [2025-03-03 10:36:07,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:36:07,873 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:36:07,885 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/eca-rers2012/Problem12_label21.c[3054,3067] [2025-03-03 10:36:08,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:36:08,159 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:36:08,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08 WrapperNode [2025-03-03 10:36:08,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:36:08,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:36:08,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:36:08,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:36:08,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,409 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:36:08,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:36:08,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:36:08,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:36:08,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:36:08,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,636 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:36:08,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:36:08,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:36:08,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:36:08,866 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:36:08,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (1/1) ... [2025-03-03 10:36:08,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:36:08,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:08,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:36:08,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:36:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:36:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:36:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:36:08,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:36:08,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:36:08,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:36:12,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:36:12,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:36:12,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:36:12,262 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:36:12,263 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:36:12,287 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:36:12,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:36:12,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:12 BoogieIcfgContainer [2025-03-03 10:36:12,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:36:12,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:36:12,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:36:12,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:36:12,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:07" (1/3) ... [2025-03-03 10:36:12,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aed70d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:12, skipping insertion in model container [2025-03-03 10:36:12,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:08" (2/3) ... [2025-03-03 10:36:12,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aed70d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:12, skipping insertion in model container [2025-03-03 10:36:12,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:12" (3/3) ... [2025-03-03 10:36:12,298 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label21.c [2025-03-03 10:36:12,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:36:12,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label21.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:36:12,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:36:12,380 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;@13243d51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:36:12,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:36:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 10:36:12,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:12,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:12,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:12,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash -54466490, now seen corresponding path program 1 times [2025-03-03 10:36:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:12,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809056124] [2025-03-03 10:36:12,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:12,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:12,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 10:36:12,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 10:36:12,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:12,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:12,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809056124] [2025-03-03 10:36:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809056124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:12,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:12,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:36:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125419456] [2025-03-03 10:36:12,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:12,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:12,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:12,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:12,609 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 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) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:15,420 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-03-03 10:36:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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) Word has length 22 [2025-03-03 10:36:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:15,436 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 10:36:15,436 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:36:15,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:15,442 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 875 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:15,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 156 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:36:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:36:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:36:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.8458471760797341) internal successors, (2778), 1505 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2778 transitions. [2025-03-03 10:36:15,525 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2778 transitions. Word has length 22 [2025-03-03 10:36:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:15,525 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2778 transitions. [2025-03-03 10:36:15,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2778 transitions. [2025-03-03 10:36:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 10:36:15,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:15,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:15,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:36:15,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:15,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:15,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1482461615, now seen corresponding path program 1 times [2025-03-03 10:36:15,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:15,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371155058] [2025-03-03 10:36:15,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:15,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 10:36:15,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 10:36:15,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:15,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:15,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371155058] [2025-03-03 10:36:15,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371155058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:15,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086634304] [2025-03-03 10:36:15,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:15,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:15,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:15,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:15,897 INFO L87 Difference]: Start difference. First operand 1506 states and 2778 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:19,991 INFO L93 Difference]: Finished difference Result 5263 states and 9668 transitions. [2025-03-03 10:36:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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) Word has length 91 [2025-03-03 10:36:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:20,002 INFO L225 Difference]: With dead ends: 5263 [2025-03-03 10:36:20,002 INFO L226 Difference]: Without dead ends: 3759 [2025-03-03 10:36:20,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:20,004 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 2177 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5155 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 6303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 5155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:20,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 710 Invalid, 6303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 5155 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 10:36:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2025-03-03 10:36:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2025-03-03 10:36:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.5721128259712613) internal successors, (5908), 3758 states have internal predecessors, (5908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5908 transitions. [2025-03-03 10:36:20,055 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5908 transitions. Word has length 91 [2025-03-03 10:36:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:20,055 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5908 transitions. [2025-03-03 10:36:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5908 transitions. [2025-03-03 10:36:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 10:36:20,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:20,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:20,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:36:20,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:20,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash 164386858, now seen corresponding path program 1 times [2025-03-03 10:36:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495481387] [2025-03-03 10:36:20,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:20,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 10:36:20,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 10:36:20,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:20,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:20,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495481387] [2025-03-03 10:36:20,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495481387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:36:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485805066] [2025-03-03 10:36:20,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:20,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:20,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:20,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:36:20,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:36:20,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 10:36:20,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 10:36:20,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:20,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:20,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:36:20,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:36:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:20,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:36:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485805066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:20,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:36:20,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:36:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070545374] [2025-03-03 10:36:20,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:20,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:20,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:20,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:20,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:36:20,487 INFO L87 Difference]: Start difference. First operand 3759 states and 5908 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:22,623 INFO L93 Difference]: Finished difference Result 10520 states and 16962 transitions. [2025-03-03 10:36:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) Word has length 93 [2025-03-03 10:36:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:22,644 INFO L225 Difference]: With dead ends: 10520 [2025-03-03 10:36:22,644 INFO L226 Difference]: Without dead ends: 6763 [2025-03-03 10:36:22,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:36:22,651 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 768 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:22,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 978 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-03-03 10:36:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2025-03-03 10:36:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.536231884057971) internal successors, (10388), 6762 states have internal predecessors, (10388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 10388 transitions. [2025-03-03 10:36:22,748 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 10388 transitions. Word has length 93 [2025-03-03 10:36:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:22,749 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 10388 transitions. [2025-03-03 10:36:22,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 10388 transitions. [2025-03-03 10:36:22,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 10:36:22,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:22,754 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 10:36:22,761 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-03 10:36:22,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:22,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:22,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:22,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2081648565, now seen corresponding path program 1 times [2025-03-03 10:36:22,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:22,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593902840] [2025-03-03 10:36:22,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:22,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:22,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 10:36:22,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 10:36:22,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:22,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593902840] [2025-03-03 10:36:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593902840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362638488] [2025-03-03 10:36:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:23,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:23,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:23,278 INFO L87 Difference]: Start difference. First operand 6763 states and 10388 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:25,853 INFO L93 Difference]: Finished difference Result 17316 states and 26703 transitions. [2025-03-03 10:36:25,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:25,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 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) Word has length 162 [2025-03-03 10:36:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:25,876 INFO L225 Difference]: With dead ends: 17316 [2025-03-03 10:36:25,877 INFO L226 Difference]: Without dead ends: 10518 [2025-03-03 10:36:25,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:25,883 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 703 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 3806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:25,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 707 Invalid, 3806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [699 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:36:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10518 states. [2025-03-03 10:36:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10518 to 9767. [2025-03-03 10:36:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.377329510546795) internal successors, (13451), 9766 states have internal predecessors, (13451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 13451 transitions. [2025-03-03 10:36:26,020 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 13451 transitions. Word has length 162 [2025-03-03 10:36:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:26,021 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 13451 transitions. [2025-03-03 10:36:26,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 13451 transitions. [2025-03-03 10:36:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-03 10:36:26,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:26,023 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:26,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:36:26,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:26,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash -871646596, now seen corresponding path program 1 times [2025-03-03 10:36:26,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:26,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450106769] [2025-03-03 10:36:26,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:26,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-03 10:36:26,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-03 10:36:26,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:26,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 10:36:26,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450106769] [2025-03-03 10:36:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450106769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:36:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565033021] [2025-03-03 10:36:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:26,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:26,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:26,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:26,225 INFO L87 Difference]: Start difference. First operand 9767 states and 13451 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:28,312 INFO L93 Difference]: Finished difference Result 25542 states and 36329 transitions. [2025-03-03 10:36:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:28,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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) Word has length 244 [2025-03-03 10:36:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:28,340 INFO L225 Difference]: With dead ends: 25542 [2025-03-03 10:36:28,340 INFO L226 Difference]: Without dead ends: 15777 [2025-03-03 10:36:28,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:28,347 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:28,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 312 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:36:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15777 states. [2025-03-03 10:36:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15777 to 14273. [2025-03-03 10:36:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14273 states, 14272 states have (on average 1.3726877802690582) internal successors, (19591), 14272 states have internal predecessors, (19591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 19591 transitions. [2025-03-03 10:36:28,532 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 19591 transitions. Word has length 244 [2025-03-03 10:36:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:28,534 INFO L471 AbstractCegarLoop]: Abstraction has 14273 states and 19591 transitions. [2025-03-03 10:36:28,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 19591 transitions. [2025-03-03 10:36:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 10:36:28,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:28,538 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:28,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:36:28,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:28,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1825740106, now seen corresponding path program 1 times [2025-03-03 10:36:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527413860] [2025-03-03 10:36:28,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:28,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 10:36:28,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 10:36:28,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:28,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:28,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:28,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527413860] [2025-03-03 10:36:28,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527413860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:28,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:28,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:28,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649690665] [2025-03-03 10:36:28,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:28,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:28,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:28,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:28,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:28,710 INFO L87 Difference]: Start difference. First operand 14273 states and 19591 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:31,098 INFO L93 Difference]: Finished difference Result 36054 states and 50093 transitions. [2025-03-03 10:36:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:31,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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) Word has length 272 [2025-03-03 10:36:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:31,137 INFO L225 Difference]: With dead ends: 36054 [2025-03-03 10:36:31,137 INFO L226 Difference]: Without dead ends: 21783 [2025-03-03 10:36:31,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:31,149 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 654 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:31,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1217 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:36:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21783 states. [2025-03-03 10:36:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21783 to 20281. [2025-03-03 10:36:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20281 states, 20280 states have (on average 1.3588264299802761) internal successors, (27557), 20280 states have internal predecessors, (27557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20281 states to 20281 states and 27557 transitions. [2025-03-03 10:36:31,372 INFO L78 Accepts]: Start accepts. Automaton has 20281 states and 27557 transitions. Word has length 272 [2025-03-03 10:36:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:31,372 INFO L471 AbstractCegarLoop]: Abstraction has 20281 states and 27557 transitions. [2025-03-03 10:36:31,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20281 states and 27557 transitions. [2025-03-03 10:36:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 10:36:31,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:31,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:31,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:36:31,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:31,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1053333888, now seen corresponding path program 1 times [2025-03-03 10:36:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:31,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505853012] [2025-03-03 10:36:31,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:31,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:31,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 10:36:31,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 10:36:31,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:31,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 80 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:31,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:31,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505853012] [2025-03-03 10:36:31,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505853012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:36:31,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383755695] [2025-03-03 10:36:31,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:31,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:31,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:31,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:36:31,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:36:31,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 10:36:31,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 10:36:31,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:31,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:31,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:36:31,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:36:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 10:36:32,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:36:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383755695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:32,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:36:32,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 10:36:32,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237620733] [2025-03-03 10:36:32,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:32,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:32,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:32,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:32,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:36:32,109 INFO L87 Difference]: Start difference. First operand 20281 states and 27557 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:34,265 INFO L93 Difference]: Finished difference Result 50323 states and 68605 transitions. [2025-03-03 10:36:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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) Word has length 276 [2025-03-03 10:36:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:34,312 INFO L225 Difference]: With dead ends: 50323 [2025-03-03 10:36:34,312 INFO L226 Difference]: Without dead ends: 30044 [2025-03-03 10:36:34,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:36:34,331 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 670 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:34,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 496 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:36:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30044 states. [2025-03-03 10:36:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30044 to 26289. [2025-03-03 10:36:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26289 states, 26288 states have (on average 1.2149269628727937) internal successors, (31938), 26288 states have internal predecessors, (31938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26289 states to 26289 states and 31938 transitions. [2025-03-03 10:36:34,638 INFO L78 Accepts]: Start accepts. Automaton has 26289 states and 31938 transitions. Word has length 276 [2025-03-03 10:36:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:34,639 INFO L471 AbstractCegarLoop]: Abstraction has 26289 states and 31938 transitions. [2025-03-03 10:36:34,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 26289 states and 31938 transitions. [2025-03-03 10:36:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-03 10:36:34,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:34,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:34,650 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-03 10:36:34,843 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,SelfDestructingSolverStorable6 [2025-03-03 10:36:34,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:34,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2119909127, now seen corresponding path program 1 times [2025-03-03 10:36:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116006235] [2025-03-03 10:36:34,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:34,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-03 10:36:34,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-03 10:36:34,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:34,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:36:35,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116006235] [2025-03-03 10:36:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116006235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:35,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:35,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469986956] [2025-03-03 10:36:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:35,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:35,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:35,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:35,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:35,141 INFO L87 Difference]: Start difference. First operand 26289 states and 31938 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:37,530 INFO L93 Difference]: Finished difference Result 73604 states and 90225 transitions. [2025-03-03 10:36:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:37,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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) Word has length 321 [2025-03-03 10:36:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:37,581 INFO L225 Difference]: With dead ends: 73604 [2025-03-03 10:36:37,581 INFO L226 Difference]: Without dead ends: 47317 [2025-03-03 10:36:37,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:37,652 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 731 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:37,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 368 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:36:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47317 states. [2025-03-03 10:36:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47317 to 46566. [2025-03-03 10:36:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46566 states, 46565 states have (on average 1.1904219907655964) internal successors, (55432), 46565 states have internal predecessors, (55432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46566 states to 46566 states and 55432 transitions. [2025-03-03 10:36:38,102 INFO L78 Accepts]: Start accepts. Automaton has 46566 states and 55432 transitions. Word has length 321 [2025-03-03 10:36:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:38,102 INFO L471 AbstractCegarLoop]: Abstraction has 46566 states and 55432 transitions. [2025-03-03 10:36:38,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 46566 states and 55432 transitions. [2025-03-03 10:36:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-03 10:36:38,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:38,107 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:38,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:36:38,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:38,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash 560339785, now seen corresponding path program 1 times [2025-03-03 10:36:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264531960] [2025-03-03 10:36:38,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:38,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 10:36:38,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 10:36:38,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:38,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:36:38,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264531960] [2025-03-03 10:36:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264531960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:38,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826445315] [2025-03-03 10:36:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:38,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:38,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:38,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:38,418 INFO L87 Difference]: Start difference. First operand 46566 states and 55432 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:40,828 INFO L93 Difference]: Finished difference Result 120166 states and 143935 transitions. [2025-03-03 10:36:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:40,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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) Word has length 353 [2025-03-03 10:36:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:40,907 INFO L225 Difference]: With dead ends: 120166 [2025-03-03 10:36:40,907 INFO L226 Difference]: Without dead ends: 73602 [2025-03-03 10:36:40,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:40,933 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 853 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:40,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1117 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:40,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73602 states. [2025-03-03 10:36:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73602 to 73602. [2025-03-03 10:36:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73602 states, 73601 states have (on average 1.163177130745506) internal successors, (85611), 73601 states have internal predecessors, (85611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73602 states to 73602 states and 85611 transitions. [2025-03-03 10:36:41,708 INFO L78 Accepts]: Start accepts. Automaton has 73602 states and 85611 transitions. Word has length 353 [2025-03-03 10:36:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:41,708 INFO L471 AbstractCegarLoop]: Abstraction has 73602 states and 85611 transitions. [2025-03-03 10:36:41,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 73602 states and 85611 transitions. [2025-03-03 10:36:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-03 10:36:41,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:41,714 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:41,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:36:41,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:41,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:41,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2031491061, now seen corresponding path program 1 times [2025-03-03 10:36:41,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:41,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648767172] [2025-03-03 10:36:41,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:41,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-03 10:36:41,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-03 10:36:41,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:41,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:36:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648767172] [2025-03-03 10:36:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648767172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:41,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:41,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:41,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85134633] [2025-03-03 10:36:41,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:41,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:41,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:41,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:41,911 INFO L87 Difference]: Start difference. First operand 73602 states and 85611 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:44,437 INFO L93 Difference]: Finished difference Result 168981 states and 199360 transitions. [2025-03-03 10:36:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:44,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) Word has length 425 [2025-03-03 10:36:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:44,536 INFO L225 Difference]: With dead ends: 168981 [2025-03-03 10:36:44,536 INFO L226 Difference]: Without dead ends: 95381 [2025-03-03 10:36:44,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:44,565 INFO L435 NwaCegarLoop]: 1234 mSDtfsCounter, 598 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:44,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1242 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:36:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95381 states. [2025-03-03 10:36:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95381 to 95381. [2025-03-03 10:36:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95381 states, 95380 states have (on average 1.1437513105472845) internal successors, (109091), 95380 states have internal predecessors, (109091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95381 states to 95381 states and 109091 transitions. [2025-03-03 10:36:45,532 INFO L78 Accepts]: Start accepts. Automaton has 95381 states and 109091 transitions. Word has length 425 [2025-03-03 10:36:45,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:45,533 INFO L471 AbstractCegarLoop]: Abstraction has 95381 states and 109091 transitions. [2025-03-03 10:36:45,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:45,533 INFO L276 IsEmpty]: Start isEmpty. Operand 95381 states and 109091 transitions. [2025-03-03 10:36:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 10:36:45,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:45,541 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:45,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:36:45,542 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:45,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash -980917691, now seen corresponding path program 1 times [2025-03-03 10:36:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112616661] [2025-03-03 10:36:45,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:45,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 10:36:45,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 10:36:45,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:45,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-03 10:36:45,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112616661] [2025-03-03 10:36:45,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112616661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:45,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:45,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:45,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173071982] [2025-03-03 10:36:45,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:46,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:46,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:46,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:46,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:46,000 INFO L87 Difference]: Start difference. First operand 95381 states and 109091 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:48,301 INFO L93 Difference]: Finished difference Result 237322 states and 270308 transitions. [2025-03-03 10:36:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:48,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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) Word has length 457 [2025-03-03 10:36:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:48,446 INFO L225 Difference]: With dead ends: 237322 [2025-03-03 10:36:48,446 INFO L226 Difference]: Without dead ends: 141943 [2025-03-03 10:36:48,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:48,498 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 744 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 2727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:48,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 611 Invalid, 2727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:36:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141943 states. [2025-03-03 10:36:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141943 to 135184. [2025-03-03 10:36:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135184 states, 135183 states have (on average 1.1242611866876753) internal successors, (151981), 135183 states have internal predecessors, (151981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135184 states to 135184 states and 151981 transitions. [2025-03-03 10:36:49,988 INFO L78 Accepts]: Start accepts. Automaton has 135184 states and 151981 transitions. Word has length 457 [2025-03-03 10:36:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:49,988 INFO L471 AbstractCegarLoop]: Abstraction has 135184 states and 151981 transitions. [2025-03-03 10:36:49,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 135184 states and 151981 transitions. [2025-03-03 10:36:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-03 10:36:50,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:50,013 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:50,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:36:50,014 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:50,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:50,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1165013496, now seen corresponding path program 1 times [2025-03-03 10:36:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:50,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76761319] [2025-03-03 10:36:50,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:50,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:50,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-03 10:36:50,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-03 10:36:50,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:50,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-03 10:36:50,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76761319] [2025-03-03 10:36:50,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76761319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:50,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:50,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:50,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285681624] [2025-03-03 10:36:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:50,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:50,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:50,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:50,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:50,446 INFO L87 Difference]: Start difference. First operand 135184 states and 151981 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:52,859 INFO L93 Difference]: Finished difference Result 276374 states and 310163 transitions. [2025-03-03 10:36:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:52,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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) Word has length 591 [2025-03-03 10:36:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:53,031 INFO L225 Difference]: With dead ends: 276374 [2025-03-03 10:36:53,032 INFO L226 Difference]: Without dead ends: 141192 [2025-03-03 10:36:53,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:53,107 INFO L435 NwaCegarLoop]: 1180 mSDtfsCounter, 722 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:53,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1188 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:36:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141192 states. [2025-03-03 10:36:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141192 to 135935. [2025-03-03 10:36:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135935 states, 135934 states have (on average 1.0881972133535391) internal successors, (147923), 135934 states have internal predecessors, (147923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135935 states to 135935 states and 147923 transitions. [2025-03-03 10:36:54,997 INFO L78 Accepts]: Start accepts. Automaton has 135935 states and 147923 transitions. Word has length 591 [2025-03-03 10:36:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:54,998 INFO L471 AbstractCegarLoop]: Abstraction has 135935 states and 147923 transitions. [2025-03-03 10:36:54,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand 135935 states and 147923 transitions. [2025-03-03 10:36:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-03-03 10:36:55,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:55,021 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:55,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:36:55,021 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:55,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:55,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1266691530, now seen corresponding path program 1 times [2025-03-03 10:36:55,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:55,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202031708] [2025-03-03 10:36:55,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:55,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:55,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-03-03 10:36:55,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-03-03 10:36:55,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:55,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 225 proven. 777 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-03 10:36:55,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202031708] [2025-03-03 10:36:55,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202031708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:36:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740465343] [2025-03-03 10:36:55,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:55,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:55,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:55,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:36:55,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:36:55,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-03-03 10:36:55,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-03-03 10:36:55,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:55,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:55,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:36:55,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:36:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2025-03-03 10:36:55,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:36:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740465343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:55,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:36:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-03 10:36:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496221872] [2025-03-03 10:36:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:55,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:55,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:55,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:55,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:36:55,929 INFO L87 Difference]: Start difference. First operand 135935 states and 147923 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:58,279 INFO L93 Difference]: Finished difference Result 289141 states and 314633 transitions. [2025-03-03 10:36:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:58,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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) Word has length 647 [2025-03-03 10:36:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:58,476 INFO L225 Difference]: With dead ends: 289141 [2025-03-03 10:36:58,477 INFO L226 Difference]: Without dead ends: 153208 [2025-03-03 10:36:58,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:36:58,740 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 852 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:58,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1117 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:36:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153208 states. [2025-03-03 10:36:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153208 to 117911. [2025-03-03 10:36:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117911 states, 117910 states have (on average 1.0867610889661605) internal successors, (128140), 117910 states have internal predecessors, (128140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117911 states to 117911 states and 128140 transitions. [2025-03-03 10:37:00,043 INFO L78 Accepts]: Start accepts. Automaton has 117911 states and 128140 transitions. Word has length 647 [2025-03-03 10:37:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:00,044 INFO L471 AbstractCegarLoop]: Abstraction has 117911 states and 128140 transitions. [2025-03-03 10:37:00,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 117911 states and 128140 transitions. [2025-03-03 10:37:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-03-03 10:37:00,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:00,074 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:00,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:37:00,278 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-03 10:37:00,278 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:00,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1561829040, now seen corresponding path program 1 times [2025-03-03 10:37:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312670495] [2025-03-03 10:37:00,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:00,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-03-03 10:37:00,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-03-03 10:37:00,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:00,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:37:00,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:00,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312670495] [2025-03-03 10:37:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312670495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:00,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900301315] [2025-03-03 10:37:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:00,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:00,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:00,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:00,731 INFO L87 Difference]: Start difference. First operand 117911 states and 128140 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:02,886 INFO L93 Difference]: Finished difference Result 240326 states and 260855 transitions. [2025-03-03 10:37:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:02,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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) Word has length 703 [2025-03-03 10:37:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:03,011 INFO L225 Difference]: With dead ends: 240326 [2025-03-03 10:37:03,011 INFO L226 Difference]: Without dead ends: 117160 [2025-03-03 10:37:03,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:03,078 INFO L435 NwaCegarLoop]: 1228 mSDtfsCounter, 468 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:03,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1235 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:37:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117160 states. [2025-03-03 10:37:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117160 to 114156. [2025-03-03 10:37:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114156 states, 114155 states have (on average 1.0669878673733082) internal successors, (121802), 114155 states have internal predecessors, (121802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114156 states to 114156 states and 121802 transitions. [2025-03-03 10:37:04,411 INFO L78 Accepts]: Start accepts. Automaton has 114156 states and 121802 transitions. Word has length 703 [2025-03-03 10:37:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:04,412 INFO L471 AbstractCegarLoop]: Abstraction has 114156 states and 121802 transitions. [2025-03-03 10:37:04,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:04,412 INFO L276 IsEmpty]: Start isEmpty. Operand 114156 states and 121802 transitions. [2025-03-03 10:37:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-03-03 10:37:04,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:04,444 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:04,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:37:04,444 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:04,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash -766128098, now seen corresponding path program 1 times [2025-03-03 10:37:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:04,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905328283] [2025-03-03 10:37:04,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:04,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-03-03 10:37:04,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-03-03 10:37:04,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 613 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-03 10:37:04,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:04,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905328283] [2025-03-03 10:37:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905328283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:04,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874912448] [2025-03-03 10:37:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:04,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:04,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:04,932 INFO L87 Difference]: Start difference. First operand 114156 states and 121802 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:07,284 INFO L93 Difference]: Finished difference Result 252342 states and 271074 transitions. [2025-03-03 10:37:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:07,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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) Word has length 732 [2025-03-03 10:37:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:07,428 INFO L225 Difference]: With dead ends: 252342 [2025-03-03 10:37:07,428 INFO L226 Difference]: Without dead ends: 138939 [2025-03-03 10:37:07,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:07,489 INFO L435 NwaCegarLoop]: 1281 mSDtfsCounter, 667 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:07,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1289 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:37:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138939 states. [2025-03-03 10:37:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138939 to 136686. [2025-03-03 10:37:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136686 states, 136685 states have (on average 1.0610015729597249) internal successors, (145023), 136685 states have internal predecessors, (145023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136686 states to 136686 states and 145023 transitions. [2025-03-03 10:37:08,719 INFO L78 Accepts]: Start accepts. Automaton has 136686 states and 145023 transitions. Word has length 732 [2025-03-03 10:37:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:08,719 INFO L471 AbstractCegarLoop]: Abstraction has 136686 states and 145023 transitions. [2025-03-03 10:37:08,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 136686 states and 145023 transitions. [2025-03-03 10:37:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-03-03 10:37:08,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:08,747 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:08,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:37:08,747 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:08,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:08,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1456266639, now seen corresponding path program 1 times [2025-03-03 10:37:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:08,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548984238] [2025-03-03 10:37:08,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:08,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-03-03 10:37:08,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-03-03 10:37:08,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:08,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 541 proven. 317 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-03 10:37:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548984238] [2025-03-03 10:37:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548984238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:37:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427957434] [2025-03-03 10:37:09,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:09,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:37:09,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:37:09,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:37:09,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:37:09,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-03-03 10:37:09,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-03-03 10:37:09,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:09,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:09,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:37:09,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:37:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 861 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-03 10:37:09,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:37:09,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427957434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:09,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:37:09,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:37:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730037284] [2025-03-03 10:37:09,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:09,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:09,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:09,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:09,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:37:09,719 INFO L87 Difference]: Start difference. First operand 136686 states and 145023 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:12,602 INFO L93 Difference]: Finished difference Result 320683 states and 340056 transitions. [2025-03-03 10:37:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:12,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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) Word has length 794 [2025-03-03 10:37:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:12,825 INFO L225 Difference]: With dead ends: 320683 [2025-03-03 10:37:12,825 INFO L226 Difference]: Without dead ends: 184750 [2025-03-03 10:37:12,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 794 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:37:12,929 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 723 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:12,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 926 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:37:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184750 states. [2025-03-03 10:37:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184750 to 167477. [2025-03-03 10:37:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167477 states, 167476 states have (on average 1.0551899973727579) internal successors, (176719), 167476 states have internal predecessors, (176719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167477 states to 167477 states and 176719 transitions. [2025-03-03 10:37:14,600 INFO L78 Accepts]: Start accepts. Automaton has 167477 states and 176719 transitions. Word has length 794 [2025-03-03 10:37:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:14,601 INFO L471 AbstractCegarLoop]: Abstraction has 167477 states and 176719 transitions. [2025-03-03 10:37:14,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 167477 states and 176719 transitions. [2025-03-03 10:37:14,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2025-03-03 10:37:14,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:14,638 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:14,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:37:14,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:37:14,838 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:14,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1438327980, now seen corresponding path program 1 times [2025-03-03 10:37:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:14,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201966231] [2025-03-03 10:37:14,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:14,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes. [2025-03-03 10:37:14,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements. [2025-03-03 10:37:14,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:14,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 870 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 10:37:16,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:16,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201966231] [2025-03-03 10:37:16,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201966231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:16,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:16,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:37:16,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393177409] [2025-03-03 10:37:16,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:16,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:37:16,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:16,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:37:16,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:37:16,728 INFO L87 Difference]: Start difference. First operand 167477 states and 176719 transitions. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 5 states have internal predecessors, (788), 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)