./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label19.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 8fb9a44013f129b42a7ee402f5ad064de240b9b8bfc3efdb0ecb991ba7dde0d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:54:37,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:54:37,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:54:37,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:54:37,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:54:37,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:54:37,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:54:37,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:54:37,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:54:37,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:54:37,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:54:37,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:54:37,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:54:37,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:54:37,307 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:54:37,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:54:37,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:54:37,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:54:37,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:54:37,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:54:37,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:54:37,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:54:37,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:54:37,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:54:37,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:54:37,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:54:37,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:54:37,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:54:37,309 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 -> 8fb9a44013f129b42a7ee402f5ad064de240b9b8bfc3efdb0ecb991ba7dde0d1 [2025-03-16 14:54:37,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:54:37,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:54:37,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:54:37,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:54:37,549 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:54:37,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label19.c [2025-03-16 14:54:38,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095248007/e6b95fb90f4c41db927b08eb77326428/FLAG226811bb7 [2025-03-16 14:54:39,169 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:54:39,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label19.c [2025-03-16 14:54:39,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095248007/e6b95fb90f4c41db927b08eb77326428/FLAG226811bb7 [2025-03-16 14:54:39,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095248007/e6b95fb90f4c41db927b08eb77326428 [2025-03-16 14:54:39,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:54:39,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:54:39,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:54:39,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:54:39,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:54:39,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:54:39" (1/1) ... [2025-03-16 14:54:39,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f53cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:39, skipping insertion in model container [2025-03-16 14:54:39,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:54:39" (1/1) ... [2025-03-16 14:54:39,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:54:39,535 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_label19.c[2130,2143] [2025-03-16 14:54:40,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:54:40,016 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:54:40,027 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_label19.c[2130,2143] [2025-03-16 14:54:40,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:54:40,282 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:54:40,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40 WrapperNode [2025-03-16 14:54:40,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:54:40,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:54:40,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:54:40,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:54:40,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,566 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:54:40,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:54:40,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:54:40,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:54:40,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:54:40,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,744 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-16 14:54:40,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:54:40,961 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:54:40,961 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:54:40,961 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:54:40,963 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (1/1) ... [2025-03-16 14:54:40,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:54:40,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:54:40,989 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-16 14:54:40,994 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-16 14:54:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:54:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:54:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:54:41,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:54:41,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:54:41,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:54:44,294 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:54:44,294 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:54:44,295 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:54:44,482 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:54:44,482 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:54:44,511 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:54:44,515 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:54:44,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:54:44 BoogieIcfgContainer [2025-03-16 14:54:44,515 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:54:44,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:54:44,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:54:44,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:54:44,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:54:39" (1/3) ... [2025-03-16 14:54:44,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e66766a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:54:44, skipping insertion in model container [2025-03-16 14:54:44,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:40" (2/3) ... [2025-03-16 14:54:44,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e66766a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:54:44, skipping insertion in model container [2025-03-16 14:54:44,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:54:44" (3/3) ... [2025-03-16 14:54:44,524 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label19.c [2025-03-16 14:54:44,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:54:44,537 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label19.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:54:44,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:54:44,604 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;@6b2d9ed9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:54:44,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:54:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 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-16 14:54:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 14:54:44,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:44,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:44,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:44,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash 353051984, now seen corresponding path program 1 times [2025-03-16 14:54:44,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:44,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203177258] [2025-03-16 14:54:44,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:44,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 14:54:44,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 14:54:44,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:44,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:44,723 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-16 14:54:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203177258] [2025-03-16 14:54:44,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203177258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:44,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:54:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521248921] [2025-03-16 14:54:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:44,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:54:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:44,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:54:44,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:54:44,752 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-16 14:54:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:44,819 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:54:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:54:44,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2025-03-16 14:54:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:44,835 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:54:44,835 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:54:44,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:54:44,844 INFO L435 NwaCegarLoop]: 1441 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:44,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:54:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:54:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:54:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 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-16 14:54:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:54:44,911 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 13 [2025-03-16 14:54:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:44,913 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:54:44,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-16 14:54:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:54:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 14:54:44,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:44,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:44,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:54:44,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1008981456, now seen corresponding path program 1 times [2025-03-16 14:54:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347891181] [2025-03-16 14:54:44,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 14:54:44,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 14:54:44,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:44,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:45,013 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-16 14:54:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:45,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347891181] [2025-03-16 14:54:45,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347891181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:45,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:45,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:54:45,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696855652] [2025-03-16 14:54:45,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:45,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:45,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:45,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:45,015 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-16 14:54:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:47,706 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2025-03-16 14:54:47,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:47,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2025-03-16 14:54:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:47,711 INFO L225 Difference]: With dead ends: 2258 [2025-03-16 14:54:47,712 INFO L226 Difference]: Without dead ends: 1505 [2025-03-16 14:54:47,712 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-16 14:54:47,713 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 855 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:47,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 114 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:54:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-16 14:54:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-03-16 14:54:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.846409574468085) internal successors, (2777), 1504 states have internal predecessors, (2777), 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-16 14:54:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2777 transitions. [2025-03-16 14:54:47,755 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2777 transitions. Word has length 13 [2025-03-16 14:54:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:47,755 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2777 transitions. [2025-03-16 14:54:47,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-16 14:54:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2777 transitions. [2025-03-16 14:54:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 14:54:47,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:47,758 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:54:47,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:54:47,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:47,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:47,762 INFO L85 PathProgramCache]: Analyzing trace with hash 913096295, now seen corresponding path program 1 times [2025-03-16 14:54:47,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:47,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088436834] [2025-03-16 14:54:47,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:47,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:47,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 14:54:47,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 14:54:47,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:47,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:54:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088436834] [2025-03-16 14:54:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088436834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:48,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:48,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400312963] [2025-03-16 14:54:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:48,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:54:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:48,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:54:48,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:54:48,133 INFO L87 Difference]: Start difference. First operand 1505 states and 2777 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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-16 14:54:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:52,509 INFO L93 Difference]: Finished difference Result 5262 states and 9667 transitions. [2025-03-16 14:54:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:54:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2025-03-16 14:54:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:52,525 INFO L225 Difference]: With dead ends: 5262 [2025-03-16 14:54:52,526 INFO L226 Difference]: Without dead ends: 3758 [2025-03-16 14:54:52,532 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-16 14:54:52,534 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 2176 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5155 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 709 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.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:52,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 709 Invalid, 6303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 5155 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 14:54:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2025-03-16 14:54:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3758. [2025-03-16 14:54:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.5722651051370775) internal successors, (5907), 3757 states have internal predecessors, (5907), 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-16 14:54:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 5907 transitions. [2025-03-16 14:54:52,611 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 5907 transitions. Word has length 82 [2025-03-16 14:54:52,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:52,612 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 5907 transitions. [2025-03-16 14:54:52,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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-16 14:54:52,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 5907 transitions. [2025-03-16 14:54:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 14:54:52,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:52,615 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:54:52,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:54:52,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:52,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2004974110, now seen corresponding path program 1 times [2025-03-16 14:54:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:52,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799987373] [2025-03-16 14:54:52,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:52,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 14:54:52,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 14:54:52,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:52,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:54:52,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:52,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799987373] [2025-03-16 14:54:52,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799987373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:52,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:54:52,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624848964] [2025-03-16 14:54:52,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:52,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:52,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:52,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:52,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:52,782 INFO L87 Difference]: Start difference. First operand 3758 states and 5907 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 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-16 14:54:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:54,882 INFO L93 Difference]: Finished difference Result 10519 states and 16961 transitions. [2025-03-16 14:54:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:54,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 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 84 [2025-03-16 14:54:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:54,911 INFO L225 Difference]: With dead ends: 10519 [2025-03-16 14:54:54,911 INFO L226 Difference]: Without dead ends: 6762 [2025-03-16 14:54:54,919 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-16 14:54:54,924 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 726 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:54,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 473 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:54:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2025-03-16 14:54:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2025-03-16 14:54:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.4244934181334121) internal successors, (9631), 6761 states have internal predecessors, (9631), 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-16 14:54:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 9631 transitions. [2025-03-16 14:54:55,017 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 9631 transitions. Word has length 84 [2025-03-16 14:54:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:55,018 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 9631 transitions. [2025-03-16 14:54:55,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 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-16 14:54:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 9631 transitions. [2025-03-16 14:54:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 14:54:55,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:55,023 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:54:55,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:54:55,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:55,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1764356481, now seen corresponding path program 1 times [2025-03-16 14:54:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:55,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164798541] [2025-03-16 14:54:55,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:55,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 14:54:55,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 14:54:55,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:55,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:54:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:55,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164798541] [2025-03-16 14:54:55,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164798541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:55,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:55,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764024449] [2025-03-16 14:54:55,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:55,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:54:55,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:55,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:54:55,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:54:55,339 INFO L87 Difference]: Start difference. First operand 6762 states and 9631 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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-16 14:54:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:57,526 INFO L93 Difference]: Finished difference Result 15813 states and 22043 transitions. [2025-03-16 14:54:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:54:57,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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 161 [2025-03-16 14:54:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:57,550 INFO L225 Difference]: With dead ends: 15813 [2025-03-16 14:54:57,551 INFO L226 Difference]: Without dead ends: 9015 [2025-03-16 14:54:57,560 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-16 14:54:57,561 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 703 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:57,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 705 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:54:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9015 states. [2025-03-16 14:54:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9015 to 8264. [2025-03-16 14:54:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8264 states, 8263 states have (on average 1.3485416918794626) internal successors, (11143), 8263 states have internal predecessors, (11143), 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-16 14:54:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 11143 transitions. [2025-03-16 14:54:57,665 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 11143 transitions. Word has length 161 [2025-03-16 14:54:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:57,665 INFO L471 AbstractCegarLoop]: Abstraction has 8264 states and 11143 transitions. [2025-03-16 14:54:57,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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-16 14:54:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 11143 transitions. [2025-03-16 14:54:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 14:54:57,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:57,667 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:54:57,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:54:57,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:57,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1986590049, now seen corresponding path program 1 times [2025-03-16 14:54:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:57,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697955776] [2025-03-16 14:54:57,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:57,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 14:54:57,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 14:54:57,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:57,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 14:54:57,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:57,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697955776] [2025-03-16 14:54:57,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697955776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:57,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:57,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176858049] [2025-03-16 14:54:57,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:57,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:57,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:57,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:57,851 INFO L87 Difference]: Start difference. First operand 8264 states and 11143 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-16 14:54:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:59,929 INFO L93 Difference]: Finished difference Result 19531 states and 27315 transitions. [2025-03-16 14:54:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 225 [2025-03-16 14:54:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:59,954 INFO L225 Difference]: With dead ends: 19531 [2025-03-16 14:54:59,954 INFO L226 Difference]: Without dead ends: 11268 [2025-03-16 14:54:59,961 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-16 14:54:59,961 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 758 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:59,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 573 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:54:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11268 states. [2025-03-16 14:55:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11268 to 8264. [2025-03-16 14:55:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8264 states, 8263 states have (on average 1.3485416918794626) internal successors, (11143), 8263 states have internal predecessors, (11143), 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-16 14:55:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 11143 transitions. [2025-03-16 14:55:00,109 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 11143 transitions. Word has length 225 [2025-03-16 14:55:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:00,110 INFO L471 AbstractCegarLoop]: Abstraction has 8264 states and 11143 transitions. [2025-03-16 14:55:00,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-16 14:55:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 11143 transitions. [2025-03-16 14:55:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 14:55:00,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:00,116 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:55:00,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:55:00,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:00,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash 431875517, now seen corresponding path program 1 times [2025-03-16 14:55:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302021492] [2025-03-16 14:55:00,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:00,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:55:00,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:55:00,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:00,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:55:00,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:00,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302021492] [2025-03-16 14:55:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302021492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:00,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:00,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:00,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984466207] [2025-03-16 14:55:00,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:00,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:00,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:00,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:00,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:00,263 INFO L87 Difference]: Start difference. First operand 8264 states and 11143 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-16 14:55:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:02,380 INFO L93 Difference]: Finished difference Result 24037 states and 32670 transitions. [2025-03-16 14:55:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:02,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 226 [2025-03-16 14:55:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:02,406 INFO L225 Difference]: With dead ends: 24037 [2025-03-16 14:55:02,406 INFO L226 Difference]: Without dead ends: 15774 [2025-03-16 14:55:02,417 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-16 14:55:02,418 INFO L435 NwaCegarLoop]: 1057 mSDtfsCounter, 692 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2497 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 2497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:02,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1063 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 2497 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:55:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15774 states. [2025-03-16 14:55:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15774 to 15774. [2025-03-16 14:55:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.3138274266151018) internal successors, (20723), 15773 states have internal predecessors, (20723), 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-16 14:55:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 20723 transitions. [2025-03-16 14:55:02,657 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 20723 transitions. Word has length 226 [2025-03-16 14:55:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:02,657 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 20723 transitions. [2025-03-16 14:55:02,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-16 14:55:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 20723 transitions. [2025-03-16 14:55:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-16 14:55:02,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:02,661 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:55:02,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:55:02,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:02,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1726806707, now seen corresponding path program 1 times [2025-03-16 14:55:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437451510] [2025-03-16 14:55:02,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:02,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-16 14:55:02,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-16 14:55:02,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:02,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:55:02,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437451510] [2025-03-16 14:55:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437451510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:02,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:02,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243442859] [2025-03-16 14:55:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:02,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:02,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:02,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:02,855 INFO L87 Difference]: Start difference. First operand 15774 states and 20723 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-16 14:55:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:05,083 INFO L93 Difference]: Finished difference Result 39057 states and 51830 transitions. [2025-03-16 14:55:05,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 230 [2025-03-16 14:55:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:05,172 INFO L225 Difference]: With dead ends: 39057 [2025-03-16 14:55:05,172 INFO L226 Difference]: Without dead ends: 23284 [2025-03-16 14:55:05,180 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-16 14:55:05,181 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 712 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:05,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1225 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:55:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23284 states. [2025-03-16 14:55:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23284 to 23284. [2025-03-16 14:55:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23284 states, 23283 states have (on average 1.3012068891465876) internal successors, (30296), 23283 states have internal predecessors, (30296), 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-16 14:55:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 30296 transitions. [2025-03-16 14:55:05,395 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 30296 transitions. Word has length 230 [2025-03-16 14:55:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:05,396 INFO L471 AbstractCegarLoop]: Abstraction has 23284 states and 30296 transitions. [2025-03-16 14:55:05,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-16 14:55:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 30296 transitions. [2025-03-16 14:55:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-16 14:55:05,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:05,403 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:55:05,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:55:05,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:05,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1797815238, now seen corresponding path program 1 times [2025-03-16 14:55:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:05,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565033415] [2025-03-16 14:55:05,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:05,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-16 14:55:05,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-16 14:55:05,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:05,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-16 14:55:05,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:05,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565033415] [2025-03-16 14:55:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565033415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:05,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:05,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:55:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066913564] [2025-03-16 14:55:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:05,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:05,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:05,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:05,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:05,543 INFO L87 Difference]: Start difference. First operand 23284 states and 30296 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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-16 14:55:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:07,790 INFO L93 Difference]: Finished difference Result 61589 states and 81572 transitions. [2025-03-16 14:55:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:07,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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 235 [2025-03-16 14:55:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:07,835 INFO L225 Difference]: With dead ends: 61589 [2025-03-16 14:55:07,835 INFO L226 Difference]: Without dead ends: 38306 [2025-03-16 14:55:07,851 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-16 14:55:07,854 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:07,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 335 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:55:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38306 states. [2025-03-16 14:55:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38306 to 35300. [2025-03-16 14:55:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35300 states, 35299 states have (on average 1.2846256267882943) internal successors, (45346), 35299 states have internal predecessors, (45346), 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-16 14:55:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35300 states to 35300 states and 45346 transitions. [2025-03-16 14:55:08,157 INFO L78 Accepts]: Start accepts. Automaton has 35300 states and 45346 transitions. Word has length 235 [2025-03-16 14:55:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:08,157 INFO L471 AbstractCegarLoop]: Abstraction has 35300 states and 45346 transitions. [2025-03-16 14:55:08,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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-16 14:55:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 35300 states and 45346 transitions. [2025-03-16 14:55:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 14:55:08,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:08,160 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 14:55:08,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:55:08,160 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:08,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1582233546, now seen corresponding path program 1 times [2025-03-16 14:55:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570180276] [2025-03-16 14:55:08,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:08,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 14:55:08,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 14:55:08,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:08,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 64 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:55:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570180276] [2025-03-16 14:55:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570180276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:55:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224899617] [2025-03-16 14:55:08,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:55:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:55:08,475 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-16 14:55:08,476 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-16 14:55:08,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 14:55:08,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 14:55:08,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:08,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:08,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:55:08,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:55:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-16 14:55:08,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:55:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224899617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:55:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 14:55:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572904694] [2025-03-16 14:55:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:08,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:08,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:08,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:55:08,836 INFO L87 Difference]: Start difference. First operand 35300 states and 45346 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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-16 14:55:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:10,875 INFO L93 Difference]: Finished difference Result 86370 states and 111182 transitions. [2025-03-16 14:55:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:10,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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 267 [2025-03-16 14:55:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:10,933 INFO L225 Difference]: With dead ends: 86370 [2025-03-16 14:55:10,933 INFO L226 Difference]: Without dead ends: 51071 [2025-03-16 14:55:11,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 266 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-16 14:55:11,046 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 693 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:11,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 426 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:55:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51071 states. [2025-03-16 14:55:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51071 to 45814. [2025-03-16 14:55:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45814 states, 45813 states have (on average 1.1646475891122607) internal successors, (53356), 45813 states have internal predecessors, (53356), 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-16 14:55:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45814 states to 45814 states and 53356 transitions. [2025-03-16 14:55:11,516 INFO L78 Accepts]: Start accepts. Automaton has 45814 states and 53356 transitions. Word has length 267 [2025-03-16 14:55:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:11,516 INFO L471 AbstractCegarLoop]: Abstraction has 45814 states and 53356 transitions. [2025-03-16 14:55:11,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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-16 14:55:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 45814 states and 53356 transitions. [2025-03-16 14:55:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-16 14:55:11,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:11,520 INFO L218 NwaCegarLoop]: trace histogram [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, 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-16 14:55:11,526 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-16 14:55:11,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 14:55:11,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:11,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1993463055, now seen corresponding path program 1 times [2025-03-16 14:55:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:11,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11779691] [2025-03-16 14:55:11,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:11,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-16 14:55:11,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-16 14:55:11,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:11,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:55:11,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:11,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11779691] [2025-03-16 14:55:11,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11779691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:11,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:11,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:11,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171016534] [2025-03-16 14:55:11,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:11,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:11,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:11,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:11,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:11,936 INFO L87 Difference]: Start difference. First operand 45814 states and 53356 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-16 14:55:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:14,350 INFO L93 Difference]: Finished difference Result 112655 states and 132741 transitions. [2025-03-16 14:55:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:14,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 312 [2025-03-16 14:55:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:14,415 INFO L225 Difference]: With dead ends: 112655 [2025-03-16 14:55:14,416 INFO L226 Difference]: Without dead ends: 66842 [2025-03-16 14:55:14,443 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-16 14:55:14,443 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 722 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 710 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:14,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 409 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [710 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:55:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66842 states. [2025-03-16 14:55:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66842 to 65340. [2025-03-16 14:55:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65340 states, 65339 states have (on average 1.161649244708367) internal successors, (75901), 65339 states have internal predecessors, (75901), 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-16 14:55:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65340 states to 65340 states and 75901 transitions. [2025-03-16 14:55:15,092 INFO L78 Accepts]: Start accepts. Automaton has 65340 states and 75901 transitions. Word has length 312 [2025-03-16 14:55:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:15,093 INFO L471 AbstractCegarLoop]: Abstraction has 65340 states and 75901 transitions. [2025-03-16 14:55:15,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-16 14:55:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 65340 states and 75901 transitions. [2025-03-16 14:55:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-16 14:55:15,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:15,096 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:55:15,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:55:15,096 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:15,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash 890453313, now seen corresponding path program 1 times [2025-03-16 14:55:15,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:15,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072169403] [2025-03-16 14:55:15,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:15,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-16 14:55:15,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-16 14:55:15,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:15,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 14:55:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072169403] [2025-03-16 14:55:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072169403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:15,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007803823] [2025-03-16 14:55:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:15,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:15,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:15,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:15,235 INFO L87 Difference]: Start difference. First operand 65340 states and 75901 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-16 14:55:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:17,604 INFO L93 Difference]: Finished difference Result 130679 states and 151801 transitions. [2025-03-16 14:55:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:17,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 344 [2025-03-16 14:55:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:17,670 INFO L225 Difference]: With dead ends: 130679 [2025-03-16 14:55:17,671 INFO L226 Difference]: Without dead ends: 65340 [2025-03-16 14:55:17,699 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-16 14:55:17,699 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 764 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:17,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 399 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:55:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65340 states. [2025-03-16 14:55:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65340 to 63838. [2025-03-16 14:55:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63838 states, 63837 states have (on average 1.1451352663815655) internal successors, (73102), 63837 states have internal predecessors, (73102), 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-16 14:55:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63838 states to 63838 states and 73102 transitions. [2025-03-16 14:55:18,346 INFO L78 Accepts]: Start accepts. Automaton has 63838 states and 73102 transitions. Word has length 344 [2025-03-16 14:55:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:18,347 INFO L471 AbstractCegarLoop]: Abstraction has 63838 states and 73102 transitions. [2025-03-16 14:55:18,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-16 14:55:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 63838 states and 73102 transitions. [2025-03-16 14:55:18,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-16 14:55:18,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:18,361 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:55:18,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:55:18,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:18,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash -854742496, now seen corresponding path program 1 times [2025-03-16 14:55:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203860220] [2025-03-16 14:55:18,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:18,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-16 14:55:18,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-16 14:55:18,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:18,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:55:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:18,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203860220] [2025-03-16 14:55:18,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203860220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:18,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:18,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242161954] [2025-03-16 14:55:18,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:18,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:18,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:18,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:18,705 INFO L87 Difference]: Start difference. First operand 63838 states and 73102 transitions. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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-16 14:55:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:21,007 INFO L93 Difference]: Finished difference Result 132932 states and 151589 transitions. [2025-03-16 14:55:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:21,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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 498 [2025-03-16 14:55:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:21,092 INFO L225 Difference]: With dead ends: 132932 [2025-03-16 14:55:21,092 INFO L226 Difference]: Without dead ends: 69095 [2025-03-16 14:55:21,129 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-16 14:55:21,130 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 589 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:21,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1186 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:55:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69095 states. [2025-03-16 14:55:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69095 to 61585. [2025-03-16 14:55:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61585 states, 61584 states have (on average 1.1005131202909846) internal successors, (67774), 61584 states have internal predecessors, (67774), 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-16 14:55:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61585 states to 61585 states and 67774 transitions. [2025-03-16 14:55:21,833 INFO L78 Accepts]: Start accepts. Automaton has 61585 states and 67774 transitions. Word has length 498 [2025-03-16 14:55:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:21,833 INFO L471 AbstractCegarLoop]: Abstraction has 61585 states and 67774 transitions. [2025-03-16 14:55:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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-16 14:55:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 61585 states and 67774 transitions. [2025-03-16 14:55:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-03-16 14:55:21,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:21,843 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 14:55:21,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:55:21,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:21,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:21,843 INFO L85 PathProgramCache]: Analyzing trace with hash -449715217, now seen corresponding path program 1 times [2025-03-16 14:55:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:21,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115454252] [2025-03-16 14:55:21,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:21,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:21,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-03-16 14:55:21,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-03-16 14:55:21,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:21,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-16 14:55:21,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115454252] [2025-03-16 14:55:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115454252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:21,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:21,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:21,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915048353] [2025-03-16 14:55:21,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:21,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:21,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:21,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:21,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:21,982 INFO L87 Difference]: Start difference. First operand 61585 states and 67774 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-16 14:55:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:24,257 INFO L93 Difference]: Finished difference Result 142695 states and 157734 transitions. [2025-03-16 14:55:24,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:24,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 504 [2025-03-16 14:55:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:24,356 INFO L225 Difference]: With dead ends: 142695 [2025-03-16 14:55:24,356 INFO L226 Difference]: Without dead ends: 81111 [2025-03-16 14:55:24,388 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-16 14:55:24,388 INFO L435 NwaCegarLoop]: 1131 mSDtfsCounter, 854 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:24,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1138 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:55:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81111 states. [2025-03-16 14:55:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81111 to 81111. [2025-03-16 14:55:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81111 states, 81110 states have (on average 1.087658735051165) internal successors, (88220), 81110 states have internal predecessors, (88220), 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-16 14:55:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81111 states to 81111 states and 88220 transitions. [2025-03-16 14:55:25,271 INFO L78 Accepts]: Start accepts. Automaton has 81111 states and 88220 transitions. Word has length 504 [2025-03-16 14:55:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:25,271 INFO L471 AbstractCegarLoop]: Abstraction has 81111 states and 88220 transitions. [2025-03-16 14:55:25,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-16 14:55:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 81111 states and 88220 transitions. [2025-03-16 14:55:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-16 14:55:25,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:25,286 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 14:55:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:55:25,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:25,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash 370024051, now seen corresponding path program 1 times [2025-03-16 14:55:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:25,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456137273] [2025-03-16 14:55:25,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:25,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-16 14:55:25,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-16 14:55:25,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:25,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 14:55:25,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:25,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456137273] [2025-03-16 14:55:25,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456137273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:25,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:25,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:25,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836209994] [2025-03-16 14:55:25,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:25,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:25,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:25,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:25,632 INFO L87 Difference]: Start difference. First operand 81111 states and 88220 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-16 14:55:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:27,983 INFO L93 Difference]: Finished difference Result 199771 states and 218122 transitions. [2025-03-16 14:55:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:27,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 555 [2025-03-16 14:55:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:28,110 INFO L225 Difference]: With dead ends: 199771 [2025-03-16 14:55:28,110 INFO L226 Difference]: Without dead ends: 113404 [2025-03-16 14:55:28,161 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-16 14:55:28,162 INFO L435 NwaCegarLoop]: 1296 mSDtfsCounter, 580 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:28,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1302 Invalid, 2646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:55:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113404 states. [2025-03-16 14:55:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113404 to 112653. [2025-03-16 14:55:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112653 states, 112652 states have (on average 1.0784273692433335) internal successors, (121487), 112652 states have internal predecessors, (121487), 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-16 14:55:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112653 states to 112653 states and 121487 transitions. [2025-03-16 14:55:29,375 INFO L78 Accepts]: Start accepts. Automaton has 112653 states and 121487 transitions. Word has length 555 [2025-03-16 14:55:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:29,376 INFO L471 AbstractCegarLoop]: Abstraction has 112653 states and 121487 transitions. [2025-03-16 14:55:29,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-16 14:55:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 112653 states and 121487 transitions. [2025-03-16 14:55:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-03-16 14:55:29,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:29,394 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:55:29,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:55:29,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:29,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2122714695, now seen corresponding path program 1 times [2025-03-16 14:55:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708555956] [2025-03-16 14:55:29,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:29,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-03-16 14:55:29,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-03-16 14:55:29,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:29,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:55:29,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:29,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708555956] [2025-03-16 14:55:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708555956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:29,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:29,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096598857] [2025-03-16 14:55:29,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:29,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:29,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:29,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:29,618 INFO L87 Difference]: Start difference. First operand 112653 states and 121487 transitions. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-16 14:55:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:32,393 INFO L93 Difference]: Finished difference Result 258349 states and 280361 transitions. [2025-03-16 14:55:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:32,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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 627 [2025-03-16 14:55:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:32,556 INFO L225 Difference]: With dead ends: 258349 [2025-03-16 14:55:32,556 INFO L226 Difference]: Without dead ends: 146448 [2025-03-16 14:55:32,599 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-16 14:55:32,599 INFO L435 NwaCegarLoop]: 1256 mSDtfsCounter, 595 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:32,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1263 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:55:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146448 states. [2025-03-16 14:55:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146448 to 142693. [2025-03-16 14:55:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142693 states, 142692 states have (on average 1.0693521711098029) internal successors, (152588), 142692 states have internal predecessors, (152588), 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-16 14:55:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142693 states to 142693 states and 152588 transitions. [2025-03-16 14:55:34,102 INFO L78 Accepts]: Start accepts. Automaton has 142693 states and 152588 transitions. Word has length 627 [2025-03-16 14:55:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:34,102 INFO L471 AbstractCegarLoop]: Abstraction has 142693 states and 152588 transitions. [2025-03-16 14:55:34,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-16 14:55:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 142693 states and 152588 transitions. [2025-03-16 14:55:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-03-16 14:55:34,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:34,119 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 14:55:34,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:55:34,120 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:34,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash -30979593, now seen corresponding path program 1 times [2025-03-16 14:55:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:34,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138177632] [2025-03-16 14:55:34,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:34,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:34,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-16 14:55:34,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-16 14:55:34,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:34,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 811 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:55:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138177632] [2025-03-16 14:55:36,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138177632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:55:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215307357] [2025-03-16 14:55:36,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:36,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:55:36,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:55:36,038 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-16 14:55:36,038 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-16 14:55:36,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-16 14:55:36,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-16 14:55:36,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:36,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:36,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:55:36,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:55:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 730 proven. 116 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:55:37,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:55:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 729 proven. 117 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:55:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215307357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:55:39,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:55:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2025-03-16 14:55:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217545601] [2025-03-16 14:55:39,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:55:39,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 14:55:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:39,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 14:55:39,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:55:39,877 INFO L87 Difference]: Start difference. First operand 142693 states and 152588 transitions. Second operand has 13 states, 13 states have (on average 117.76923076923077) internal successors, (1531), 13 states have internal predecessors, (1531), 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)