./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label48.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 6abe6deda42e5cd6457f2c2e337625778fbe4d0886f20421ed4af9df8a9f44a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:38:49,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:38:49,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:38:49,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:38:49,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:38:49,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:38:49,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:38:49,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:38:49,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:38:49,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:38:49,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:38:49,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:38:49,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:38:49,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:38:49,497 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:38:49,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:38:49,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:38:49,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:38:49,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:38:49,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:38:49,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:38:49,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:38:49,499 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 -> 6abe6deda42e5cd6457f2c2e337625778fbe4d0886f20421ed4af9df8a9f44a2 [2025-03-03 10:38:49,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:38:49,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:38:49,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:38:49,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:38:49,718 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:38:49,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label48.c [2025-03-03 10:38:50,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5af17b0/de5574e126d6451a80005c38153cdf56/FLAG1182ec071 [2025-03-03 10:38:51,271 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:38:51,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label48.c [2025-03-03 10:38:51,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5af17b0/de5574e126d6451a80005c38153cdf56/FLAG1182ec071 [2025-03-03 10:38:51,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5af17b0/de5574e126d6451a80005c38153cdf56 [2025-03-03 10:38:51,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:38:51,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:38:51,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:38:51,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:38:51,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:38:51,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:38:51" (1/1) ... [2025-03-03 10:38:51,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2992ca7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:51, skipping insertion in model container [2025-03-03 10:38:51,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:38:51" (1/1) ... [2025-03-03 10:38:51,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:38:51,537 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_label48.c[1668,1681] [2025-03-03 10:38:52,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:38:52,009 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:38:52,018 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_label48.c[1668,1681] [2025-03-03 10:38:52,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:38:52,288 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:38:52,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52 WrapperNode [2025-03-03 10:38:52,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:38:52,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:38:52,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:38:52,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:38:52,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,578 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:38:52,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:38:52,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:38:52,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:38:52,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:38:52,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,779 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:38:52,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:52,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:53,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:38:53,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:38:53,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:38:53,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:38:53,028 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (1/1) ... [2025-03-03 10:38:53,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:38:53,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:38:53,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:38:53,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:38:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:38:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:38:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:38:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:38:53,129 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:38:53,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:38:56,214 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:38:56,215 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:38:56,215 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:38:56,336 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:38:56,336 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:38:56,360 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:38:56,364 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:38:56,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:38:56 BoogieIcfgContainer [2025-03-03 10:38:56,364 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:38:56,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:38:56,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:38:56,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:38:56,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:38:51" (1/3) ... [2025-03-03 10:38:56,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f1175e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:38:56, skipping insertion in model container [2025-03-03 10:38:56,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:52" (2/3) ... [2025-03-03 10:38:56,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f1175e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:38:56, skipping insertion in model container [2025-03-03 10:38:56,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:38:56" (3/3) ... [2025-03-03 10:38:56,373 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label48.c [2025-03-03 10:38:56,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:38:56,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label48.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:38:56,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:38:56,493 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;@1f724178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:38:56,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:38:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 10:38:56,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:56,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:56,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:56,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1481504872, now seen corresponding path program 1 times [2025-03-03 10:38:56,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20881873] [2025-03-03 10:38:56,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:56,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 10:38:56,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 10:38:56,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:56,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:56,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20881873] [2025-03-03 10:38:56,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20881873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:38:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413047553] [2025-03-03 10:38:56,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:56,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:56,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:56,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:56,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:56,697 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:59,409 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-03-03 10:38:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2025-03-03 10:38:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:59,424 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 10:38:59,424 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:38:59,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:59,432 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 824 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:59,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:38:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:38:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:38:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2025-03-03 10:38:59,513 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 10 [2025-03-03 10:38:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:59,514 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2025-03-03 10:38:59,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2025-03-03 10:38:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 10:38:59,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:59,515 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:38:59,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:38:59,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:59,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1831847100, now seen corresponding path program 1 times [2025-03-03 10:38:59,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:59,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990894295] [2025-03-03 10:38:59,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 10:38:59,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 10:38:59,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:59,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:59,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:59,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990894295] [2025-03-03 10:38:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990894295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:59,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:59,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:59,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967196415] [2025-03-03 10:38:59,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:59,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:59,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:59,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:59,733 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:02,169 INFO L93 Difference]: Finished difference Result 3761 states and 6366 transitions. [2025-03-03 10:39:02,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:02,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-03-03 10:39:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:02,177 INFO L225 Difference]: With dead ends: 3761 [2025-03-03 10:39:02,178 INFO L226 Difference]: Without dead ends: 2257 [2025-03-03 10:39:02,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-03 10:39:02,181 INFO L435 NwaCegarLoop]: 1202 mSDtfsCounter, 853 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:02,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1210 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:39:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-03-03 10:39:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-03-03 10:39:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5403368794326242) internal successors, (3475), 2256 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3475 transitions. [2025-03-03 10:39:02,217 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3475 transitions. Word has length 81 [2025-03-03 10:39:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:02,218 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3475 transitions. [2025-03-03 10:39:02,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3475 transitions. [2025-03-03 10:39:02,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 10:39:02,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:02,221 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:39:02,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:39:02,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:02,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:02,222 INFO L85 PathProgramCache]: Analyzing trace with hash 818002143, now seen corresponding path program 1 times [2025-03-03 10:39:02,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415627313] [2025-03-03 10:39:02,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:02,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:02,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 10:39:02,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 10:39:02,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:02,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:39:02,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:02,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415627313] [2025-03-03 10:39:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415627313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:02,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:39:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3685622] [2025-03-03 10:39:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:02,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:02,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:02,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:02,364 INFO L87 Difference]: Start difference. First operand 2257 states and 3475 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:04,376 INFO L93 Difference]: Finished difference Result 6765 states and 10420 transitions. [2025-03-03 10:39:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:04,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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-03 10:39:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:04,392 INFO L225 Difference]: With dead ends: 6765 [2025-03-03 10:39:04,392 INFO L226 Difference]: Without dead ends: 4510 [2025-03-03 10:39:04,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:04,395 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 775 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:04,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 447 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:39:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-03-03 10:39:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2025-03-03 10:39:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.371701042359725) internal successors, (6185), 4509 states have internal predecessors, (6185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 6185 transitions. [2025-03-03 10:39:04,452 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 6185 transitions. Word has length 84 [2025-03-03 10:39:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:04,452 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 6185 transitions. [2025-03-03 10:39:04,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 6185 transitions. [2025-03-03 10:39:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 10:39:04,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:04,455 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:39:04,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:39:04,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:04,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash -77788233, now seen corresponding path program 1 times [2025-03-03 10:39:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:04,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145710951] [2025-03-03 10:39:04,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:04,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:04,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 10:39:04,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 10:39:04,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:04,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:39:04,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:04,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145710951] [2025-03-03 10:39:04,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145710951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:04,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:04,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:39:04,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744269918] [2025-03-03 10:39:04,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:04,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:04,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:04,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:04,610 INFO L87 Difference]: Start difference. First operand 4510 states and 6185 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:06,714 INFO L93 Difference]: Finished difference Result 13526 states and 18551 transitions. [2025-03-03 10:39:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:06,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2025-03-03 10:39:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:06,736 INFO L225 Difference]: With dead ends: 13526 [2025-03-03 10:39:06,736 INFO L226 Difference]: Without dead ends: 9018 [2025-03-03 10:39:06,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:06,742 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 901 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:06,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 352 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:39:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9018 states. [2025-03-03 10:39:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9018 to 9016. [2025-03-03 10:39:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9016 states, 9015 states have (on average 1.2660011092623404) internal successors, (11413), 9015 states have internal predecessors, (11413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 11413 transitions. [2025-03-03 10:39:06,852 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 11413 transitions. Word has length 100 [2025-03-03 10:39:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:06,852 INFO L471 AbstractCegarLoop]: Abstraction has 9016 states and 11413 transitions. [2025-03-03 10:39:06,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 11413 transitions. [2025-03-03 10:39:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 10:39:06,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:06,856 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:39:06,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:39:06,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:06,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1337879946, now seen corresponding path program 1 times [2025-03-03 10:39:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:06,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037713349] [2025-03-03 10:39:06,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:06,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 10:39:06,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 10:39:06,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:06,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:39:07,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:07,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037713349] [2025-03-03 10:39:07,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037713349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:07,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:39:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332015239] [2025-03-03 10:39:07,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:07,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:07,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:07,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:07,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:07,005 INFO L87 Difference]: Start difference. First operand 9016 states and 11413 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:09,257 INFO L93 Difference]: Finished difference Result 27044 states and 34235 transitions. [2025-03-03 10:39:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:09,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2025-03-03 10:39:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:09,302 INFO L225 Difference]: With dead ends: 27044 [2025-03-03 10:39:09,302 INFO L226 Difference]: Without dead ends: 18030 [2025-03-03 10:39:09,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:09,310 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 702 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:09,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 631 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:39:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18030 states. [2025-03-03 10:39:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18030 to 18028. [2025-03-03 10:39:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18028 states, 18027 states have (on average 1.1805070172518999) internal successors, (21281), 18027 states have internal predecessors, (21281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 21281 transitions. [2025-03-03 10:39:09,542 INFO L78 Accepts]: Start accepts. Automaton has 18028 states and 21281 transitions. Word has length 109 [2025-03-03 10:39:09,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:09,542 INFO L471 AbstractCegarLoop]: Abstraction has 18028 states and 21281 transitions. [2025-03-03 10:39:09,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18028 states and 21281 transitions. [2025-03-03 10:39:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 10:39:09,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:09,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:09,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:39:09,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:09,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash -520078583, now seen corresponding path program 1 times [2025-03-03 10:39:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098399516] [2025-03-03 10:39:09,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:09,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 10:39:09,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 10:39:09,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:09,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 10:39:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098399516] [2025-03-03 10:39:10,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098399516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:10,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:10,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:39:10,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692230882] [2025-03-03 10:39:10,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:10,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:39:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:10,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:39:10,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:39:10,324 INFO L87 Difference]: Start difference. First operand 18028 states and 21281 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:14,129 INFO L93 Difference]: Finished difference Result 42815 states and 49978 transitions. [2025-03-03 10:39:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:39:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 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 223 [2025-03-03 10:39:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:14,196 INFO L225 Difference]: With dead ends: 42815 [2025-03-03 10:39:14,197 INFO L226 Difference]: Without dead ends: 24789 [2025-03-03 10:39:14,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:14,209 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 2737 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6061 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 6222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 6061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:14,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2737 Valid, 678 Invalid, 6222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 6061 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 10:39:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24789 states. [2025-03-03 10:39:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24789 to 23285. [2025-03-03 10:39:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.1532812231575331) internal successors, (26853), 23284 states have internal predecessors, (26853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 26853 transitions. [2025-03-03 10:39:14,430 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 26853 transitions. Word has length 223 [2025-03-03 10:39:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:14,430 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 26853 transitions. [2025-03-03 10:39:14,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 26853 transitions. [2025-03-03 10:39:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-03 10:39:14,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:14,433 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:14,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:39:14,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:14,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash 766194913, now seen corresponding path program 1 times [2025-03-03 10:39:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:14,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583212039] [2025-03-03 10:39:14,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:14,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-03 10:39:14,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-03 10:39:14,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:14,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-03 10:39:14,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:14,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583212039] [2025-03-03 10:39:14,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583212039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:14,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:14,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:14,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182691597] [2025-03-03 10:39:14,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:14,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:14,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:14,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:14,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:14,579 INFO L87 Difference]: Start difference. First operand 23285 states and 26853 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:17,227 INFO L93 Difference]: Finished difference Result 67596 states and 78145 transitions. [2025-03-03 10:39:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:17,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 250 [2025-03-03 10:39:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:17,290 INFO L225 Difference]: With dead ends: 67596 [2025-03-03 10:39:17,290 INFO L226 Difference]: Without dead ends: 44313 [2025-03-03 10:39:17,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:17,306 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 751 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:17,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1321 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2753 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:39:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44313 states. [2025-03-03 10:39:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44313 to 39056. [2025-03-03 10:39:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39056 states, 39055 states have (on average 1.1505313020099859) internal successors, (44934), 39055 states have internal predecessors, (44934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:17,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39056 states to 39056 states and 44934 transitions. [2025-03-03 10:39:17,836 INFO L78 Accepts]: Start accepts. Automaton has 39056 states and 44934 transitions. Word has length 250 [2025-03-03 10:39:17,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:17,837 INFO L471 AbstractCegarLoop]: Abstraction has 39056 states and 44934 transitions. [2025-03-03 10:39:17,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 39056 states and 44934 transitions. [2025-03-03 10:39:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 10:39:17,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:17,840 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:39:17,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:39:17,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:17,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2014198885, now seen corresponding path program 1 times [2025-03-03 10:39:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134608556] [2025-03-03 10:39:17,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:17,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 10:39:17,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 10:39:17,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:17,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 10:39:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:18,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134608556] [2025-03-03 10:39:18,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134608556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:18,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:18,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:18,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211053655] [2025-03-03 10:39:18,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:18,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:39:18,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:18,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:39:18,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:39:18,233 INFO L87 Difference]: Start difference. First operand 39056 states and 44934 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:20,976 INFO L93 Difference]: Finished difference Result 86410 states and 98689 transitions. [2025-03-03 10:39:20,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:39:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 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 294 [2025-03-03 10:39:20,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:21,039 INFO L225 Difference]: With dead ends: 86410 [2025-03-03 10:39:21,039 INFO L226 Difference]: Without dead ends: 47319 [2025-03-03 10:39:21,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:39:21,059 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 704 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:21,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 710 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:39:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47319 states. [2025-03-03 10:39:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47319 to 47317. [2025-03-03 10:39:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47317 states, 47316 states have (on average 1.125940485248119) internal successors, (53275), 47316 states have internal predecessors, (53275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47317 states to 47317 states and 53275 transitions. [2025-03-03 10:39:21,640 INFO L78 Accepts]: Start accepts. Automaton has 47317 states and 53275 transitions. Word has length 294 [2025-03-03 10:39:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:21,640 INFO L471 AbstractCegarLoop]: Abstraction has 47317 states and 53275 transitions. [2025-03-03 10:39:21,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 47317 states and 53275 transitions. [2025-03-03 10:39:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 10:39:21,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:21,647 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:21,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:39:21,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:21,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1298000885, now seen corresponding path program 1 times [2025-03-03 10:39:21,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:21,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055049790] [2025-03-03 10:39:21,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:21,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 10:39:21,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 10:39:21,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:21,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:39:21,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:21,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055049790] [2025-03-03 10:39:21,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055049790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:21,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:21,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:21,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061343551] [2025-03-03 10:39:21,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:21,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:21,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:21,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:21,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:21,868 INFO L87 Difference]: Start difference. First operand 47317 states and 53275 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-03 10:39:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:24,518 INFO L93 Difference]: Finished difference Result 111154 states and 126856 transitions. [2025-03-03 10:39:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:24,518 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 309 [2025-03-03 10:39:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:24,601 INFO L225 Difference]: With dead ends: 111154 [2025-03-03 10:39:24,601 INFO L226 Difference]: Without dead ends: 63839 [2025-03-03 10:39:24,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:24,625 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 718 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 690 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:24,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 465 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:39:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63839 states. [2025-03-03 10:39:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63839 to 63088. [2025-03-03 10:39:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63088 states, 63087 states have (on average 1.131707007782903) internal successors, (71396), 63087 states have internal predecessors, (71396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63088 states to 63088 states and 71396 transitions. [2025-03-03 10:39:25,370 INFO L78 Accepts]: Start accepts. Automaton has 63088 states and 71396 transitions. Word has length 309 [2025-03-03 10:39:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:25,371 INFO L471 AbstractCegarLoop]: Abstraction has 63088 states and 71396 transitions. [2025-03-03 10:39:25,371 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-03 10:39:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 63088 states and 71396 transitions. [2025-03-03 10:39:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-03 10:39:25,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:25,376 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:25,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:39:25,377 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:25,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash -872651173, now seen corresponding path program 1 times [2025-03-03 10:39:25,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:25,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023985496] [2025-03-03 10:39:25,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:25,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:25,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-03 10:39:25,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-03 10:39:25,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:25,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:39:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:25,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023985496] [2025-03-03 10:39:25,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023985496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:25,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:25,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:25,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997888595] [2025-03-03 10:39:25,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:25,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:25,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:25,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:25,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:25,830 INFO L87 Difference]: Start difference. First operand 63088 states and 71396 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:28,083 INFO L93 Difference]: Finished difference Result 144949 states and 163060 transitions. [2025-03-03 10:39:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 341 [2025-03-03 10:39:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:28,167 INFO L225 Difference]: With dead ends: 144949 [2025-03-03 10:39:28,167 INFO L226 Difference]: Without dead ends: 74353 [2025-03-03 10:39:28,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:28,211 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 788 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:28,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1324 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:39:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74353 states. [2025-03-03 10:39:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74353 to 66843. [2025-03-03 10:39:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66843 states, 66842 states have (on average 1.107537177223901) internal successors, (74030), 66842 states have internal predecessors, (74030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66843 states to 66843 states and 74030 transitions. [2025-03-03 10:39:28,854 INFO L78 Accepts]: Start accepts. Automaton has 66843 states and 74030 transitions. Word has length 341 [2025-03-03 10:39:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:28,855 INFO L471 AbstractCegarLoop]: Abstraction has 66843 states and 74030 transitions. [2025-03-03 10:39:28,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 66843 states and 74030 transitions. [2025-03-03 10:39:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 10:39:28,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:28,857 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:39:28,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:39:28,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:28,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash -153324401, now seen corresponding path program 1 times [2025-03-03 10:39:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602478293] [2025-03-03 10:39:28,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:28,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 10:39:28,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 10:39:28,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:28,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 41 proven. 201 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 10:39:29,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:29,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602478293] [2025-03-03 10:39:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602478293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:39:29,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122232903] [2025-03-03 10:39:29,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:29,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:29,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:39:29,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:39:29,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:39:29,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 10:39:29,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 10:39:29,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:29,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:29,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:39:29,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:39:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-03 10:39:29,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:39:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122232903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:29,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:39:29,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:39:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198968978] [2025-03-03 10:39:29,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:29,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:29,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:29,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:29,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:29,501 INFO L87 Difference]: Start difference. First operand 66843 states and 74030 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:31,367 INFO L93 Difference]: Finished difference Result 132933 states and 147302 transitions. [2025-03-03 10:39:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:31,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 342 [2025-03-03 10:39:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:31,433 INFO L225 Difference]: With dead ends: 132933 [2025-03-03 10:39:31,434 INFO L226 Difference]: Without dead ends: 66843 [2025-03-03 10:39:31,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:31,470 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 750 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:31,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 964 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:39:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66843 states. [2025-03-03 10:39:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66843 to 66843. [2025-03-03 10:39:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66843 states, 66842 states have (on average 1.088088327698154) internal successors, (72730), 66842 states have internal predecessors, (72730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66843 states to 66843 states and 72730 transitions. [2025-03-03 10:39:32,121 INFO L78 Accepts]: Start accepts. Automaton has 66843 states and 72730 transitions. Word has length 342 [2025-03-03 10:39:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:32,122 INFO L471 AbstractCegarLoop]: Abstraction has 66843 states and 72730 transitions. [2025-03-03 10:39:32,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 66843 states and 72730 transitions. [2025-03-03 10:39:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-03-03 10:39:32,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:32,126 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:32,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:39:32,326 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,SelfDestructingSolverStorable10 [2025-03-03 10:39:32,327 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:32,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:32,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1353002735, now seen corresponding path program 1 times [2025-03-03 10:39:32,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:32,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177191589] [2025-03-03 10:39:32,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:32,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:32,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-03 10:39:32,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-03 10:39:32,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:32,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 10:39:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177191589] [2025-03-03 10:39:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177191589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:32,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:32,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:39:32,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049991332] [2025-03-03 10:39:32,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:32,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:39:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:32,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:39:32,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:39:32,964 INFO L87 Difference]: Start difference. First operand 66843 states and 72730 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:36,715 INFO L93 Difference]: Finished difference Result 175740 states and 193468 transitions. [2025-03-03 10:39:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:39:36,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 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 409 [2025-03-03 10:39:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:36,825 INFO L225 Difference]: With dead ends: 175740 [2025-03-03 10:39:36,825 INFO L226 Difference]: Without dead ends: 109650 [2025-03-03 10:39:36,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:39:36,858 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 2064 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 1558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 5200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1558 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:36,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2064 Valid, 126 Invalid, 5200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1558 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 10:39:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109650 states. [2025-03-03 10:39:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109650 to 81863. [2025-03-03 10:39:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81863 states, 81862 states have (on average 1.1042363978402678) internal successors, (90395), 81862 states have internal predecessors, (90395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81863 states to 81863 states and 90395 transitions. [2025-03-03 10:39:37,535 INFO L78 Accepts]: Start accepts. Automaton has 81863 states and 90395 transitions. Word has length 409 [2025-03-03 10:39:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:37,536 INFO L471 AbstractCegarLoop]: Abstraction has 81863 states and 90395 transitions. [2025-03-03 10:39:37,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 81863 states and 90395 transitions. [2025-03-03 10:39:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-03 10:39:37,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:37,541 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:37,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:39:37,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:37,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1090273834, now seen corresponding path program 1 times [2025-03-03 10:39:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960033424] [2025-03-03 10:39:37,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:37,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-03 10:39:37,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-03 10:39:37,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:37,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-03 10:39:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960033424] [2025-03-03 10:39:38,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960033424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:38,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:38,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:38,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627932952] [2025-03-03 10:39:38,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:38,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:38,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:38,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:38,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:38,106 INFO L87 Difference]: Start difference. First operand 81863 states and 90395 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:40,455 INFO L93 Difference]: Finished difference Result 191511 states and 213353 transitions. [2025-03-03 10:39:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:40,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 424 [2025-03-03 10:39:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:40,590 INFO L225 Difference]: With dead ends: 191511 [2025-03-03 10:39:40,591 INFO L226 Difference]: Without dead ends: 110401 [2025-03-03 10:39:40,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:40,650 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 813 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2002 mSolverCounterSat, 833 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 833 IncrementalHoareTripleChecker+Valid, 2002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:40,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 138 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [833 Valid, 2002 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:39:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110401 states. [2025-03-03 10:39:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110401 to 108899. [2025-03-03 10:39:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108899 states, 108898 states have (on average 1.1055574941688553) internal successors, (120393), 108898 states have internal predecessors, (120393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108899 states to 108899 states and 120393 transitions. [2025-03-03 10:39:41,913 INFO L78 Accepts]: Start accepts. Automaton has 108899 states and 120393 transitions. Word has length 424 [2025-03-03 10:39:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:41,913 INFO L471 AbstractCegarLoop]: Abstraction has 108899 states and 120393 transitions. [2025-03-03 10:39:41,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 108899 states and 120393 transitions. [2025-03-03 10:39:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-03 10:39:41,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:41,920 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:41,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:39:41,920 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:41,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:41,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1663941910, now seen corresponding path program 1 times [2025-03-03 10:39:41,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:41,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401423972] [2025-03-03 10:39:41,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:41,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:41,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-03 10:39:41,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-03 10:39:41,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:41,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 373 proven. 54 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:39:42,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401423972] [2025-03-03 10:39:42,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401423972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:39:42,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536279834] [2025-03-03 10:39:42,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:42,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:42,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:39:42,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:39:42,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:39:42,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-03 10:39:42,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-03 10:39:42,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:42,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:42,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:39:42,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:39:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 10:39:43,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:39:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536279834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:39:43,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-03 10:39:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311156636] [2025-03-03 10:39:43,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:43,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:39:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:43,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:39:43,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:39:43,120 INFO L87 Difference]: Start difference. First operand 108899 states and 120393 transitions. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:47,091 INFO L93 Difference]: Finished difference Result 267362 states and 296599 transitions. [2025-03-03 10:39:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:39:47,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 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 432 [2025-03-03 10:39:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:47,262 INFO L225 Difference]: With dead ends: 267362 [2025-03-03 10:39:47,263 INFO L226 Difference]: Without dead ends: 159216 [2025-03-03 10:39:47,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:39:47,339 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 1384 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4974 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 5719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 4974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:47,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 442 Invalid, 5719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 4974 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 10:39:47,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159216 states. [2025-03-03 10:39:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159216 to 153208. [2025-03-03 10:39:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153208 states, 153207 states have (on average 1.0957136423270477) internal successors, (167871), 153207 states have internal predecessors, (167871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153208 states to 153208 states and 167871 transitions. [2025-03-03 10:39:48,709 INFO L78 Accepts]: Start accepts. Automaton has 153208 states and 167871 transitions. Word has length 432 [2025-03-03 10:39:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:48,709 INFO L471 AbstractCegarLoop]: Abstraction has 153208 states and 167871 transitions. [2025-03-03 10:39:48,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 153208 states and 167871 transitions. [2025-03-03 10:39:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 10:39:48,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:48,715 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:48,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:39:48,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 10:39:48,915 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:48,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1128664699, now seen corresponding path program 1 times [2025-03-03 10:39:48,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:48,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703220256] [2025-03-03 10:39:48,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:48,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:48,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 10:39:48,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 10:39:48,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:48,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:39:49,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:49,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703220256] [2025-03-03 10:39:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703220256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:49,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955378614] [2025-03-03 10:39:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:49,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:49,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:49,060 INFO L87 Difference]: Start difference. First operand 153208 states and 167871 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:51,486 INFO L93 Difference]: Finished difference Result 306414 states and 335763 transitions. [2025-03-03 10:39:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:51,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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 466 [2025-03-03 10:39:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:51,972 INFO L225 Difference]: With dead ends: 306414 [2025-03-03 10:39:51,972 INFO L226 Difference]: Without dead ends: 153959 [2025-03-03 10:39:52,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:52,008 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 746 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:52,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 992 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:39:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153959 states. [2025-03-03 10:39:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153959 to 150955. [2025-03-03 10:39:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150955 states, 150954 states have (on average 1.0797991441101262) internal successors, (163000), 150954 states have internal predecessors, (163000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150955 states to 150955 states and 163000 transitions. [2025-03-03 10:39:53,520 INFO L78 Accepts]: Start accepts. Automaton has 150955 states and 163000 transitions. Word has length 466 [2025-03-03 10:39:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:53,520 INFO L471 AbstractCegarLoop]: Abstraction has 150955 states and 163000 transitions. [2025-03-03 10:39:53,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 150955 states and 163000 transitions. [2025-03-03 10:39:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-03 10:39:53,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:53,529 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:53,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:39:53,529 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 687582956, now seen corresponding path program 1 times [2025-03-03 10:39:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124789036] [2025-03-03 10:39:53,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:53,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-03 10:39:53,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-03 10:39:53,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:53,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 267 proven. 257 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-03 10:39:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:54,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124789036] [2025-03-03 10:39:54,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124789036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:39:54,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494939003] [2025-03-03 10:39:54,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:54,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:54,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:39:54,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:39:54,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:39:54,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-03 10:39:54,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-03 10:39:54,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:54,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:54,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:39:54,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:39:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-03 10:39:54,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:39:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494939003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:54,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:39:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:39:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195874484] [2025-03-03 10:39:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:54,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:54,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:54,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:54,359 INFO L87 Difference]: Start difference. First operand 150955 states and 163000 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:56,829 INFO L93 Difference]: Finished difference Result 331948 states and 359110 transitions. [2025-03-03 10:39:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:56,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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 484 [2025-03-03 10:39:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:57,028 INFO L225 Difference]: With dead ends: 331948 [2025-03-03 10:39:57,028 INFO L226 Difference]: Without dead ends: 181746 [2025-03-03 10:39:57,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:57,114 INFO L435 NwaCegarLoop]: 1266 mSDtfsCounter, 616 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:57,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1274 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 2267 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:39:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181746 states. [2025-03-03 10:39:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181746 to 177240. [2025-03-03 10:39:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177240 states, 177239 states have (on average 1.066802453184683) internal successors, (189079), 177239 states have internal predecessors, (189079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177240 states to 177240 states and 189079 transitions. [2025-03-03 10:39:59,537 INFO L78 Accepts]: Start accepts. Automaton has 177240 states and 189079 transitions. Word has length 484 [2025-03-03 10:39:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:59,537 INFO L471 AbstractCegarLoop]: Abstraction has 177240 states and 189079 transitions. [2025-03-03 10:39:59,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 177240 states and 189079 transitions. [2025-03-03 10:39:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-03 10:39:59,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:59,544 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:39:59,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:39:59,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:59,745 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:59,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1196743584, now seen corresponding path program 1 times [2025-03-03 10:39:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:59,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98658468] [2025-03-03 10:39:59,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:59,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 10:39:59,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 10:39:59,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:59,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:40:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98658468] [2025-03-03 10:40:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98658468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:00,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:00,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:00,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693279357] [2025-03-03 10:40:00,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:00,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:00,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:00,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:00,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:00,089 INFO L87 Difference]: Start difference. First operand 177240 states and 189079 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:02,555 INFO L93 Difference]: Finished difference Result 353727 states and 377400 transitions. [2025-03-03 10:40:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:02,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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 540 [2025-03-03 10:40:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:02,763 INFO L225 Difference]: With dead ends: 353727 [2025-03-03 10:40:02,763 INFO L226 Difference]: Without dead ends: 177240 [2025-03-03 10:40:02,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:02,844 INFO L435 NwaCegarLoop]: 1241 mSDtfsCounter, 567 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:02,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1249 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:40:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177240 states. [2025-03-03 10:40:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177240 to 172734. [2025-03-03 10:40:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172734 states, 172733 states have (on average 1.0519298570626343) internal successors, (181703), 172733 states have internal predecessors, (181703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172734 states to 172734 states and 181703 transitions. [2025-03-03 10:40:04,599 INFO L78 Accepts]: Start accepts. Automaton has 172734 states and 181703 transitions. Word has length 540 [2025-03-03 10:40:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:04,599 INFO L471 AbstractCegarLoop]: Abstraction has 172734 states and 181703 transitions. [2025-03-03 10:40:04,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 172734 states and 181703 transitions. [2025-03-03 10:40:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-03 10:40:04,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:04,610 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:04,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:40:04,610 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:04,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:04,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1268691781, now seen corresponding path program 1 times [2025-03-03 10:40:04,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:04,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841435225] [2025-03-03 10:40:04,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:04,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:04,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-03 10:40:04,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-03 10:40:04,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:04,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-03 10:40:05,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841435225] [2025-03-03 10:40:05,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841435225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:05,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:05,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320630692] [2025-03-03 10:40:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:05,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:05,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:05,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:05,091 INFO L87 Difference]: Start difference. First operand 172734 states and 181703 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:07,501 INFO L93 Difference]: Finished difference Result 385269 states and 406217 transitions. [2025-03-03 10:40:07,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:07,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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-03 10:40:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:07,800 INFO L225 Difference]: With dead ends: 385269 [2025-03-03 10:40:07,800 INFO L226 Difference]: Without dead ends: 213288 [2025-03-03 10:40:07,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:07,905 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 642 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:07,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 241 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:40:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213288 states. [2025-03-03 10:40:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213288 to 210284. [2025-03-03 10:40:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210284 states, 210283 states have (on average 1.0479258903477695) internal successors, (220361), 210283 states have internal predecessors, (220361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210284 states to 210284 states and 220361 transitions. [2025-03-03 10:40:10,454 INFO L78 Accepts]: Start accepts. Automaton has 210284 states and 220361 transitions. Word has length 555 [2025-03-03 10:40:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:10,455 INFO L471 AbstractCegarLoop]: Abstraction has 210284 states and 220361 transitions. [2025-03-03 10:40:10,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 210284 states and 220361 transitions. [2025-03-03 10:40:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-03 10:40:10,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:10,463 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 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] [2025-03-03 10:40:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:40:10,463 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1820986695, now seen corresponding path program 1 times [2025-03-03 10:40:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702739922] [2025-03-03 10:40:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:10,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-03 10:40:10,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-03 10:40:10,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:10,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2025-03-03 10:40:10,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:10,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702739922] [2025-03-03 10:40:10,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702739922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:10,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:10,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423488669] [2025-03-03 10:40:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:10,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:10,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:10,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:10,925 INFO L87 Difference]: Start difference. First operand 210284 states and 220361 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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)