./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label06.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_label06.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 b8e390e3329fd730c72061af7f4f756de3cffbc4334952b16b06779e5db77927 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:34:39,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:34:39,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:34:39,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:34:39,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:34:39,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:34:39,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:34:39,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:34:39,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:34:39,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:34:39,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:34:39,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:34:39,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:34:39,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:34:39,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:34:39,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:34:39,897 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 -> b8e390e3329fd730c72061af7f4f756de3cffbc4334952b16b06779e5db77927 [2025-03-03 10:34:40,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:34:40,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:34:40,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:34:40,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:34:40,114 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:34:40,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label06.c [2025-03-03 10:34:41,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a649f7597/ce332f714d6c41c79a8d9e59afce91f4/FLAG5d26fc908 [2025-03-03 10:34:41,730 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:34:41,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label06.c [2025-03-03 10:34:41,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a649f7597/ce332f714d6c41c79a8d9e59afce91f4/FLAG5d26fc908 [2025-03-03 10:34:41,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a649f7597/ce332f714d6c41c79a8d9e59afce91f4 [2025-03-03 10:34:41,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:34:41,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:34:41,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:34:41,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:34:41,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:34:41,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:41" (1/1) ... [2025-03-03 10:34:41,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295181fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:41, skipping insertion in model container [2025-03-03 10:34:41,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:41" (1/1) ... [2025-03-03 10:34:41,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:34:42,039 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_label06.c[3178,3191] [2025-03-03 10:34:42,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:34:42,517 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:34:42,528 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_label06.c[3178,3191] [2025-03-03 10:34:42,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:34:42,777 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:34:42,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42 WrapperNode [2025-03-03 10:34:42,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:34:42,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:34:42,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:34:42,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:34:42,783 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:34:42" (1/1) ... [2025-03-03 10:34:42,823 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:34:42" (1/1) ... [2025-03-03 10:34:43,051 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:34:43,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:34:43,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:34:43,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:34:43,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:34:43,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,245 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:34:43,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:34:43,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:34:43,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:34:43,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:34:43,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (1/1) ... [2025-03-03 10:34:43,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:34:43,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:43,437 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:34:43,441 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:34:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:34:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:34:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:34:43,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:34:43,509 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:34:43,511 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:34:46,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:34:46,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:34:46,629 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:34:46,794 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:34:46,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:34:46,825 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:34:46,827 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:34:46,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:46 BoogieIcfgContainer [2025-03-03 10:34:46,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:34:46,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:34:46,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:34:46,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:34:46,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:34:41" (1/3) ... [2025-03-03 10:34:46,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea7d859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:46, skipping insertion in model container [2025-03-03 10:34:46,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:42" (2/3) ... [2025-03-03 10:34:46,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea7d859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:46, skipping insertion in model container [2025-03-03 10:34:46,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:46" (3/3) ... [2025-03-03 10:34:46,839 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label06.c [2025-03-03 10:34:46,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:34:46,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label06.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:34:46,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:34:46,929 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;@54b5025b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:34:46,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:34:46,937 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:34:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 10:34:46,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:46,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:46,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:46,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1688458089, now seen corresponding path program 1 times [2025-03-03 10:34:46,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:46,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180147175] [2025-03-03 10:34:46,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:47,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 10:34:47,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 10:34:47,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:47,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:47,174 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:34:47,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:47,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180147175] [2025-03-03 10:34:47,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180147175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:47,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:47,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:47,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664554425] [2025-03-03 10:34:47,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:47,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:47,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:47,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:47,199 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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:34:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:49,965 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-03-03 10:34:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:49,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2025-03-03 10:34:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:49,979 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 10:34:49,979 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:34:49,984 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:34:49,987 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 811 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 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:34:49,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 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:34:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:34:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:34:50,071 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:34:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2025-03-03 10:34:50,082 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 23 [2025-03-03 10:34:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:50,083 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2025-03-03 10:34:50,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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:34:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2025-03-03 10:34:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 10:34:50,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:50,087 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:34:50,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:34:50,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:50,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash -154492876, now seen corresponding path program 1 times [2025-03-03 10:34:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:50,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957186480] [2025-03-03 10:34:50,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:50,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 10:34:50,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 10:34:50,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:50,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:50,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:50,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957186480] [2025-03-03 10:34:50,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957186480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:50,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389541011] [2025-03-03 10:34:50,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:50,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:50,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:50,467 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:34:50,468 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:34:50,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 10:34:50,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 10:34:50,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:50,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:50,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:34:50,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:50,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:34:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389541011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:50,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:34:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:34:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973911745] [2025-03-03 10:34:50,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:50,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:50,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:50,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:34:50,578 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:34:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:53,178 INFO L93 Difference]: Finished difference Result 4512 states and 7393 transitions. [2025-03-03 10:34:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:53,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2025-03-03 10:34:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:53,192 INFO L225 Difference]: With dead ends: 4512 [2025-03-03 10:34:53,192 INFO L226 Difference]: Without dead ends: 3008 [2025-03-03 10:34:53,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 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:34:53,196 INFO L435 NwaCegarLoop]: 1149 mSDtfsCounter, 745 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:53,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1157 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:34:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-03-03 10:34:53,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-03-03 10:34:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.537080146325241) internal successors, (4622), 3007 states have internal predecessors, (4622), 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:34:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4622 transitions. [2025-03-03 10:34:53,249 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4622 transitions. Word has length 94 [2025-03-03 10:34:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:53,250 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4622 transitions. [2025-03-03 10:34:53,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:34:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4622 transitions. [2025-03-03 10:34:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 10:34:53,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:53,251 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:34:53,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:34:53,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:53,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:53,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1917838129, now seen corresponding path program 1 times [2025-03-03 10:34:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:53,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051662903] [2025-03-03 10:34:53,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:53,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 10:34:53,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 10:34:53,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:53,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:53,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051662903] [2025-03-03 10:34:53,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051662903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:53,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:53,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817620480] [2025-03-03 10:34:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:53,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:53,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:53,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:53,571 INFO L87 Difference]: Start difference. First operand 3008 states and 4622 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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:34:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:55,612 INFO L93 Difference]: Finished difference Result 9018 states and 13861 transitions. [2025-03-03 10:34:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:55,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 97 [2025-03-03 10:34:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:55,629 INFO L225 Difference]: With dead ends: 9018 [2025-03-03 10:34:55,630 INFO L226 Difference]: Without dead ends: 6012 [2025-03-03 10:34:55,635 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:34:55,636 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:34:55,636 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:34:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-03-03 10:34:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012. [2025-03-03 10:34:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.3726501414074197) internal successors, (8251), 6011 states have internal predecessors, (8251), 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:34:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 8251 transitions. [2025-03-03 10:34:55,723 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 8251 transitions. Word has length 97 [2025-03-03 10:34:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:55,725 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 8251 transitions. [2025-03-03 10:34:55,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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:34:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 8251 transitions. [2025-03-03 10:34:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 10:34:55,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:55,729 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:55,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:34:55,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:55,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash -949081235, now seen corresponding path program 1 times [2025-03-03 10:34:55,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:55,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963485089] [2025-03-03 10:34:55,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:55,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 10:34:55,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 10:34:55,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:55,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:55,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963485089] [2025-03-03 10:34:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963485089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:55,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521816740] [2025-03-03 10:34:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:55,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:55,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:55,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:55,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:55,980 INFO L87 Difference]: Start difference. First operand 6012 states and 8251 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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:34:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:58,157 INFO L93 Difference]: Finished difference Result 12773 states and 17371 transitions. [2025-03-03 10:34:58,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:58,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2025-03-03 10:34:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:58,174 INFO L225 Difference]: With dead ends: 12773 [2025-03-03 10:34:58,174 INFO L226 Difference]: Without dead ends: 6763 [2025-03-03 10:34:58,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:34:58,180 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 885 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:58,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1169 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:34:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-03-03 10:34:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2025-03-03 10:34:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.3321502514049097) internal successors, (9008), 6762 states have internal predecessors, (9008), 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:34:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9008 transitions. [2025-03-03 10:34:58,262 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 9008 transitions. Word has length 104 [2025-03-03 10:34:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:58,262 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 9008 transitions. [2025-03-03 10:34:58,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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:34:58,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 9008 transitions. [2025-03-03 10:34:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 10:34:58,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:58,264 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:34:58,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:34:58,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:58,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1788942691, now seen corresponding path program 1 times [2025-03-03 10:34:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:58,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186268347] [2025-03-03 10:34:58,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:58,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 10:34:58,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 10:34:58,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:58,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:58,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186268347] [2025-03-03 10:34:58,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186268347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:58,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:58,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434442195] [2025-03-03 10:34:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:58,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:58,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:58,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:58,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:58,510 INFO L87 Difference]: Start difference. First operand 6763 states and 9008 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:01,085 INFO L93 Difference]: Finished difference Result 17316 states and 23788 transitions. [2025-03-03 10:35:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:35:01,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-03-03 10:35:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:01,109 INFO L225 Difference]: With dead ends: 17316 [2025-03-03 10:35:01,109 INFO L226 Difference]: Without dead ends: 11269 [2025-03-03 10:35:01,114 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:35:01,115 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:01,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:35:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2025-03-03 10:35:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 10518. [2025-03-03 10:35:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10518 states, 10517 states have (on average 1.2198345535799182) internal successors, (12829), 10517 states have internal predecessors, (12829), 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:35:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10518 states to 10518 states and 12829 transitions. [2025-03-03 10:35:01,239 INFO L78 Accepts]: Start accepts. Automaton has 10518 states and 12829 transitions. Word has length 162 [2025-03-03 10:35:01,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:01,239 INFO L471 AbstractCegarLoop]: Abstraction has 10518 states and 12829 transitions. [2025-03-03 10:35:01,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 10518 states and 12829 transitions. [2025-03-03 10:35:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-03 10:35:01,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:01,242 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:01,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:35:01,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:01,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash -45329727, now seen corresponding path program 1 times [2025-03-03 10:35:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545916441] [2025-03-03 10:35:01,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:01,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-03 10:35:01,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-03 10:35:01,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:01,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 10:35:01,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:01,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545916441] [2025-03-03 10:35:01,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545916441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:01,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:01,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:35:01,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49168059] [2025-03-03 10:35:01,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:01,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:01,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:01,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:01,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:01,402 INFO L87 Difference]: Start difference. First operand 10518 states and 12829 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 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:35:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:03,539 INFO L93 Difference]: Finished difference Result 26293 states and 32987 transitions. [2025-03-03 10:35:03,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:03,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 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 245 [2025-03-03 10:35:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:03,570 INFO L225 Difference]: With dead ends: 26293 [2025-03-03 10:35:03,570 INFO L226 Difference]: Without dead ends: 16528 [2025-03-03 10:35:03,578 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:35:03,579 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:03,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 310 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16528 states. [2025-03-03 10:35:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16528 to 15775. [2025-03-03 10:35:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2075567389374922) internal successors, (19048), 15774 states have internal predecessors, (19048), 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:35:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 19048 transitions. [2025-03-03 10:35:03,717 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 19048 transitions. Word has length 245 [2025-03-03 10:35:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:03,717 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 19048 transitions. [2025-03-03 10:35:03,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 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:35:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 19048 transitions. [2025-03-03 10:35:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-03 10:35:03,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:03,719 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:35:03,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:35:03,720 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:03,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1669543065, now seen corresponding path program 1 times [2025-03-03 10:35:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:03,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355300009] [2025-03-03 10:35:03,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:03,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:03,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-03 10:35:03,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-03 10:35:03,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:03,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:35:03,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:03,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355300009] [2025-03-03 10:35:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355300009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:03,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546819417] [2025-03-03 10:35:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:03,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:03,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:03,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:03,842 INFO L87 Difference]: Start difference. First operand 15775 states and 19048 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:35:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:06,274 INFO L93 Difference]: Finished difference Result 39058 states and 47573 transitions. [2025-03-03 10:35:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:06,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:35:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:06,313 INFO L225 Difference]: With dead ends: 39058 [2025-03-03 10:35:06,313 INFO L226 Difference]: Without dead ends: 24036 [2025-03-03 10:35:06,327 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:35:06,328 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 673 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2718 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:06,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1361 Invalid, 3085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2718 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:35:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2025-03-03 10:35:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 22534. [2025-03-03 10:35:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.2027692717347889) internal successors, (27102), 22533 states have internal predecessors, (27102), 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:35:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 27102 transitions. [2025-03-03 10:35:06,545 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 27102 transitions. Word has length 250 [2025-03-03 10:35:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:06,546 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 27102 transitions. [2025-03-03 10:35:06,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:35:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 27102 transitions. [2025-03-03 10:35:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-03 10:35:06,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:06,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:35:06,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:35:06,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1801420842, now seen corresponding path program 1 times [2025-03-03 10:35:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979576743] [2025-03-03 10:35:06,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:06,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:06,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-03 10:35:06,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-03 10:35:06,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:06,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 10:35:06,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:06,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979576743] [2025-03-03 10:35:06,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979576743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:06,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:06,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:06,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916139570] [2025-03-03 10:35:06,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:06,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:06,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:06,693 INFO L87 Difference]: Start difference. First operand 22534 states and 27102 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:35:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:08,692 INFO L93 Difference]: Finished difference Result 44315 states and 53446 transitions. [2025-03-03 10:35:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 300 [2025-03-03 10:35:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:08,730 INFO L225 Difference]: With dead ends: 44315 [2025-03-03 10:35:08,730 INFO L226 Difference]: Without dead ends: 22534 [2025-03-03 10:35:08,745 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:35:08,746 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 804 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:08,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 993 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:35:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22534 states. [2025-03-03 10:35:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 22534. [2025-03-03 10:35:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.163804198286957) internal successors, (26224), 22533 states have internal predecessors, (26224), 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:35:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 26224 transitions. [2025-03-03 10:35:08,913 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 26224 transitions. Word has length 300 [2025-03-03 10:35:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:08,914 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 26224 transitions. [2025-03-03 10:35:08,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:35:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 26224 transitions. [2025-03-03 10:35:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-03 10:35:08,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:08,917 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:08,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:35:08,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1495914341, now seen corresponding path program 1 times [2025-03-03 10:35:08,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411691673] [2025-03-03 10:35:08,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:08,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-03 10:35:08,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-03 10:35:08,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:08,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:35:09,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:09,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411691673] [2025-03-03 10:35:09,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411691673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:09,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:09,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843430904] [2025-03-03 10:35:09,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:09,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:09,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:09,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:09,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:09,158 INFO L87 Difference]: Start difference. First operand 22534 states and 26224 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:35:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:11,488 INFO L93 Difference]: Finished difference Result 60837 states and 71593 transitions. [2025-03-03 10:35:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 322 [2025-03-03 10:35:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:11,532 INFO L225 Difference]: With dead ends: 60837 [2025-03-03 10:35:11,532 INFO L226 Difference]: Without dead ends: 39056 [2025-03-03 10:35:11,550 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:35:11,554 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 718 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:11,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 438 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:35:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39056 states. [2025-03-03 10:35:11,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39056 to 38305. [2025-03-03 10:35:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38305 states, 38304 states have (on average 1.149984335839599) internal successors, (44049), 38304 states have internal predecessors, (44049), 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:35:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38305 states to 38305 states and 44049 transitions. [2025-03-03 10:35:11,875 INFO L78 Accepts]: Start accepts. Automaton has 38305 states and 44049 transitions. Word has length 322 [2025-03-03 10:35:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:11,875 INFO L471 AbstractCegarLoop]: Abstraction has 38305 states and 44049 transitions. [2025-03-03 10:35:11,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:35:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 38305 states and 44049 transitions. [2025-03-03 10:35:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-03 10:35:11,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:11,878 INFO L218 NwaCegarLoop]: trace histogram [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, 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:35:11,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:35:11,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:11,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 221529877, now seen corresponding path program 1 times [2025-03-03 10:35:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:11,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586301936] [2025-03-03 10:35:11,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:11,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-03 10:35:11,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-03 10:35:11,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:11,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:35:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586301936] [2025-03-03 10:35:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586301936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632341764] [2025-03-03 10:35:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:12,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:12,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:12,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:12,162 INFO L87 Difference]: Start difference. First operand 38305 states and 44049 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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:35:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:14,311 INFO L93 Difference]: Finished difference Result 96134 states and 111645 transitions. [2025-03-03 10:35:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 354 [2025-03-03 10:35:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:14,365 INFO L225 Difference]: With dead ends: 96134 [2025-03-03 10:35:14,366 INFO L226 Difference]: Without dead ends: 53325 [2025-03-03 10:35:14,393 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:35:14,394 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 770 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:14,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1321 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:35:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53325 states. [2025-03-03 10:35:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53325 to 52574. [2025-03-03 10:35:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52574 states, 52573 states have (on average 1.1324063682879044) internal successors, (59534), 52573 states have internal predecessors, (59534), 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:35:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52574 states to 52574 states and 59534 transitions. [2025-03-03 10:35:15,024 INFO L78 Accepts]: Start accepts. Automaton has 52574 states and 59534 transitions. Word has length 354 [2025-03-03 10:35:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:15,025 INFO L471 AbstractCegarLoop]: Abstraction has 52574 states and 59534 transitions. [2025-03-03 10:35:15,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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:35:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 52574 states and 59534 transitions. [2025-03-03 10:35:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-03 10:35:15,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:15,028 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:35:15,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:35:15,028 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:15,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash -563823031, now seen corresponding path program 1 times [2025-03-03 10:35:15,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:15,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772737437] [2025-03-03 10:35:15,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:15,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:15,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-03 10:35:15,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-03 10:35:15,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:15,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 103 proven. 193 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 10:35:15,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:15,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772737437] [2025-03-03 10:35:15,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772737437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:35:15,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330391087] [2025-03-03 10:35:15,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:15,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:15,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:15,311 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:35:15,312 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:35:15,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-03 10:35:15,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-03 10:35:15,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:15,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:15,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:35:15,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:35:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:35:15,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:35:15,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330391087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:15,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:35:15,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:35:15,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115371194] [2025-03-03 10:35:15,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:15,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:15,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:15,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:15,537 INFO L87 Difference]: Start difference. First operand 52574 states and 59534 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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:35:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:17,921 INFO L93 Difference]: Finished difference Result 139692 states and 158289 transitions. [2025-03-03 10:35:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:17,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 362 [2025-03-03 10:35:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:18,005 INFO L225 Difference]: With dead ends: 139692 [2025-03-03 10:35:18,005 INFO L226 Difference]: Without dead ends: 87871 [2025-03-03 10:35:18,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:18,040 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 708 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:18,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 979 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [699 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:35:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87871 states. [2025-03-03 10:35:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87871 to 82614. [2025-03-03 10:35:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82614 states, 82613 states have (on average 1.1250771670318231) internal successors, (92946), 82613 states have internal predecessors, (92946), 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:35:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82614 states to 82614 states and 92946 transitions. [2025-03-03 10:35:18,861 INFO L78 Accepts]: Start accepts. Automaton has 82614 states and 92946 transitions. Word has length 362 [2025-03-03 10:35:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:18,862 INFO L471 AbstractCegarLoop]: Abstraction has 82614 states and 92946 transitions. [2025-03-03 10:35:18,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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:35:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 82614 states and 92946 transitions. [2025-03-03 10:35:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-03 10:35:18,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:18,872 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:35:18,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:35:19,076 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,SelfDestructingSolverStorable10 [2025-03-03 10:35:19,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:19,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2133720123, now seen corresponding path program 1 times [2025-03-03 10:35:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:19,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951803288] [2025-03-03 10:35:19,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:19,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-03 10:35:19,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-03 10:35:19,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:19,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-03 10:35:19,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:19,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951803288] [2025-03-03 10:35:19,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951803288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:19,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:19,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:19,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277592603] [2025-03-03 10:35:19,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:19,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:19,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:19,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:19,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:19,284 INFO L87 Difference]: Start difference. First operand 82614 states and 92946 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:35:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:21,660 INFO L93 Difference]: Finished difference Result 165226 states and 185914 transitions. [2025-03-03 10:35:21,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:35:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:21,742 INFO L225 Difference]: With dead ends: 165226 [2025-03-03 10:35:21,742 INFO L226 Difference]: Without dead ends: 83365 [2025-03-03 10:35:21,786 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:35:21,786 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 670 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 2954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:21,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 441 Invalid, 2954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:35:21,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83365 states. [2025-03-03 10:35:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83365 to 82614. [2025-03-03 10:35:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82614 states, 82613 states have (on average 1.1132630457676154) internal successors, (91970), 82613 states have internal predecessors, (91970), 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:35:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82614 states to 82614 states and 91970 transitions. [2025-03-03 10:35:22,826 INFO L78 Accepts]: Start accepts. Automaton has 82614 states and 91970 transitions. Word has length 484 [2025-03-03 10:35:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:22,827 INFO L471 AbstractCegarLoop]: Abstraction has 82614 states and 91970 transitions. [2025-03-03 10:35:22,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:35:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 82614 states and 91970 transitions. [2025-03-03 10:35:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-03 10:35:22,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:22,999 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:22,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:35:22,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 47900804, now seen corresponding path program 1 times [2025-03-03 10:35:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073627249] [2025-03-03 10:35:22,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:23,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-03 10:35:23,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-03 10:35:23,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:23,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-03 10:35:23,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:23,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073627249] [2025-03-03 10:35:23,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073627249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:23,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:23,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969565965] [2025-03-03 10:35:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:23,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:23,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:23,165 INFO L87 Difference]: Start difference. First operand 82614 states and 91970 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:35:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:25,317 INFO L93 Difference]: Finished difference Result 197519 states and 220797 transitions. [2025-03-03 10:35:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:25,317 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 521 [2025-03-03 10:35:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:25,431 INFO L225 Difference]: With dead ends: 197519 [2025-03-03 10:35:25,431 INFO L226 Difference]: Without dead ends: 115658 [2025-03-03 10:35:25,477 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:35:25,477 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 689 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:25,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 321 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:35:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115658 states. [2025-03-03 10:35:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115658 to 112654. [2025-03-03 10:35:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112654 states, 112653 states have (on average 1.096659653981696) internal successors, (123542), 112653 states have internal predecessors, (123542), 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:35:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112654 states to 112654 states and 123542 transitions. [2025-03-03 10:35:26,873 INFO L78 Accepts]: Start accepts. Automaton has 112654 states and 123542 transitions. Word has length 521 [2025-03-03 10:35:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:26,874 INFO L471 AbstractCegarLoop]: Abstraction has 112654 states and 123542 transitions. [2025-03-03 10:35:26,874 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:35:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 112654 states and 123542 transitions. [2025-03-03 10:35:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 10:35:26,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:26,883 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:26,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:35:26,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:26,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash -996288454, now seen corresponding path program 1 times [2025-03-03 10:35:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:26,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839606249] [2025-03-03 10:35:26,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:26,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 10:35:26,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 10:35:26,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:26,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-03 10:35:27,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:27,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839606249] [2025-03-03 10:35:27,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839606249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:27,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:27,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:27,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68170247] [2025-03-03 10:35:27,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:27,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:27,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:27,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:27,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:27,222 INFO L87 Difference]: Start difference. First operand 112654 states and 123542 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:35:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:29,656 INFO L93 Difference]: Finished difference Result 256097 states and 281692 transitions. [2025-03-03 10:35:29,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:29,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 526 [2025-03-03 10:35:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:29,819 INFO L225 Difference]: With dead ends: 256097 [2025-03-03 10:35:29,819 INFO L226 Difference]: Without dead ends: 144196 [2025-03-03 10:35:29,888 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:35:29,888 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 664 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 2741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:29,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1285 Invalid, 2741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:35:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144196 states. [2025-03-03 10:35:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144196 to 141192. [2025-03-03 10:35:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141192 states, 141191 states have (on average 1.088851272389883) internal successors, (153736), 141191 states have internal predecessors, (153736), 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:35:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141192 states to 141192 states and 153736 transitions. [2025-03-03 10:35:31,270 INFO L78 Accepts]: Start accepts. Automaton has 141192 states and 153736 transitions. Word has length 526 [2025-03-03 10:35:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:31,271 INFO L471 AbstractCegarLoop]: Abstraction has 141192 states and 153736 transitions. [2025-03-03 10:35:31,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:35:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 141192 states and 153736 transitions. [2025-03-03 10:35:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-03 10:35:31,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:31,280 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:31,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:35:31,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:31,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:31,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2006650156, now seen corresponding path program 1 times [2025-03-03 10:35:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874789537] [2025-03-03 10:35:31,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:31,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 10:35:31,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 10:35:31,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:31,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-03 10:35:31,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:31,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874789537] [2025-03-03 10:35:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874789537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:31,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:31,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:31,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80876470] [2025-03-03 10:35:31,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:31,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:31,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:31,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:31,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:31,851 INFO L87 Difference]: Start difference. First operand 141192 states and 153736 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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:35:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:34,289 INFO L93 Difference]: Finished difference Result 286888 states and 312057 transitions. [2025-03-03 10:35:34,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:34,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 553 [2025-03-03 10:35:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:34,470 INFO L225 Difference]: With dead ends: 286888 [2025-03-03 10:35:34,470 INFO L226 Difference]: Without dead ends: 146449 [2025-03-03 10:35:34,550 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:35:34,551 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 686 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:34,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1185 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:35:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146449 states. [2025-03-03 10:35:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146449 to 140441. [2025-03-03 10:35:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140441 states, 140440 states have (on average 1.0602178866419822) internal successors, (148897), 140440 states have internal predecessors, (148897), 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:35:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140441 states to 140441 states and 148897 transitions. [2025-03-03 10:35:36,036 INFO L78 Accepts]: Start accepts. Automaton has 140441 states and 148897 transitions. Word has length 553 [2025-03-03 10:35:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:36,036 INFO L471 AbstractCegarLoop]: Abstraction has 140441 states and 148897 transitions. [2025-03-03 10:35:36,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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:35:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 140441 states and 148897 transitions. [2025-03-03 10:35:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 10:35:36,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:36,055 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:36,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:35:36,055 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:36,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:36,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1241041434, now seen corresponding path program 1 times [2025-03-03 10:35:36,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:36,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393230778] [2025-03-03 10:35:36,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:36,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:36,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 10:35:36,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 10:35:36,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:36,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 10:35:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393230778] [2025-03-03 10:35:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393230778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:36,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:36,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653902281] [2025-03-03 10:35:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:36,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:36,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:36,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:36,497 INFO L87 Difference]: Start difference. First operand 140441 states and 148897 transitions. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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:35:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:39,116 INFO L93 Difference]: Finished difference Result 310169 states and 329745 transitions. [2025-03-03 10:35:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:39,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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 683 [2025-03-03 10:35:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:39,288 INFO L225 Difference]: With dead ends: 310169 [2025-03-03 10:35:39,288 INFO L226 Difference]: Without dead ends: 170481 [2025-03-03 10:35:39,346 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:35:39,346 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 771 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:39,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 123 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170481 states. [2025-03-03 10:35:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170481 to 170481. [2025-03-03 10:35:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170481 states, 170480 states have (on average 1.0594791177850775) internal successors, (180620), 170480 states have internal predecessors, (180620), 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:35:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170481 states to 170481 states and 180620 transitions. [2025-03-03 10:35:40,855 INFO L78 Accepts]: Start accepts. Automaton has 170481 states and 180620 transitions. Word has length 683 [2025-03-03 10:35:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:40,856 INFO L471 AbstractCegarLoop]: Abstraction has 170481 states and 180620 transitions. [2025-03-03 10:35:40,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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:35:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 170481 states and 180620 transitions. [2025-03-03 10:35:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2025-03-03 10:35:40,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:40,877 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:40,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:35:40,877 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:40,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:40,878 INFO L85 PathProgramCache]: Analyzing trace with hash -98064151, now seen corresponding path program 1 times [2025-03-03 10:35:40,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:40,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246865150] [2025-03-03 10:35:40,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:40,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 758 statements into 1 equivalence classes. [2025-03-03 10:35:40,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 758 of 758 statements. [2025-03-03 10:35:40,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:40,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-03-03 10:35:41,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:41,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246865150] [2025-03-03 10:35:41,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246865150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:41,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:41,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:41,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016573037] [2025-03-03 10:35:41,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:41,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:41,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:41,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:41,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:41,575 INFO L87 Difference]: Start difference. First operand 170481 states and 180620 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:35:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:43,944 INFO L93 Difference]: Finished difference Result 366494 states and 387940 transitions. [2025-03-03 10:35:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:43,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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 758 [2025-03-03 10:35:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:44,167 INFO L225 Difference]: With dead ends: 366494 [2025-03-03 10:35:44,167 INFO L226 Difference]: Without dead ends: 191509 [2025-03-03 10:35:44,274 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:35:44,274 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 469 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:44,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1340 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:35:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191509 states. [2025-03-03 10:35:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191509 to 182497. [2025-03-03 10:35:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182497 states, 182496 states have (on average 1.048214755391899) internal successors, (191295), 182496 states have internal predecessors, (191295), 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:35:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182497 states to 182497 states and 191295 transitions. [2025-03-03 10:35:46,523 INFO L78 Accepts]: Start accepts. Automaton has 182497 states and 191295 transitions. Word has length 758 [2025-03-03 10:35:46,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:46,523 INFO L471 AbstractCegarLoop]: Abstraction has 182497 states and 191295 transitions. [2025-03-03 10:35:46,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:35:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 182497 states and 191295 transitions. [2025-03-03 10:35:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2025-03-03 10:35:46,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:46,549 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:46,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:35:46,549 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:46,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:46,550 INFO L85 PathProgramCache]: Analyzing trace with hash 891338380, now seen corresponding path program 1 times [2025-03-03 10:35:46,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:46,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625038293] [2025-03-03 10:35:46,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:46,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:46,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 782 statements into 1 equivalence classes. [2025-03-03 10:35:46,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 782 of 782 statements. [2025-03-03 10:35:46,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:46,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-03 10:35:46,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625038293] [2025-03-03 10:35:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625038293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:46,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:46,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599398330] [2025-03-03 10:35:46,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:46,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:46,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:46,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:46,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:46,884 INFO L87 Difference]: Start difference. First operand 182497 states and 191295 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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:35:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:49,359 INFO L93 Difference]: Finished difference Result 364241 states and 381832 transitions. [2025-03-03 10:35:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:49,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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 782 [2025-03-03 10:35:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:49,589 INFO L225 Difference]: With dead ends: 364241 [2025-03-03 10:35:49,589 INFO L226 Difference]: Without dead ends: 182497 [2025-03-03 10:35:49,708 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:35:49,709 INFO L435 NwaCegarLoop]: 1143 mSDtfsCounter, 466 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:49,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1151 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2141 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:35:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182497 states. [2025-03-03 10:35:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182497 to 171232. [2025-03-03 10:35:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171232 states, 171231 states have (on average 1.0342519754016504) internal successors, (177096), 171231 states have internal predecessors, (177096), 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:35:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171232 states to 171232 states and 177096 transitions. [2025-03-03 10:35:51,523 INFO L78 Accepts]: Start accepts. Automaton has 171232 states and 177096 transitions. Word has length 782 [2025-03-03 10:35:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:51,524 INFO L471 AbstractCegarLoop]: Abstraction has 171232 states and 177096 transitions. [2025-03-03 10:35:51,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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:35:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 171232 states and 177096 transitions. [2025-03-03 10:35:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-03-03 10:35:51,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:51,548 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:51,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:35:51,548 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:51,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2099785953, now seen corresponding path program 1 times [2025-03-03 10:35:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:51,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597555327] [2025-03-03 10:35:51,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:51,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-03-03 10:35:51,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-03-03 10:35:51,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:51,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-03-03 10:35:52,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597555327] [2025-03-03 10:35:52,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597555327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:52,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230913651] [2025-03-03 10:35:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:52,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:52,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:52,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:52,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:52,101 INFO L87 Difference]: Start difference. First operand 171232 states and 177096 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:35:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:54,674 INFO L93 Difference]: Finished difference Result 347719 states and 359629 transitions. [2025-03-03 10:35:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:54,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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 840 [2025-03-03 10:35:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:54,879 INFO L225 Difference]: With dead ends: 347719 [2025-03-03 10:35:54,880 INFO L226 Difference]: Without dead ends: 177240 [2025-03-03 10:35:54,964 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:35:54,965 INFO L435 NwaCegarLoop]: 1091 mSDtfsCounter, 850 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:54,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1099 Invalid, 2443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:35:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177240 states. [2025-03-03 10:35:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177240 to 171983. [2025-03-03 10:35:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171983 states, 171982 states have (on average 1.0298345175657917) internal successors, (177113), 171982 states have internal predecessors, (177113), 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:35:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171983 states to 171983 states and 177113 transitions. [2025-03-03 10:35:56,981 INFO L78 Accepts]: Start accepts. Automaton has 171983 states and 177113 transitions. Word has length 840 [2025-03-03 10:35:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:56,981 INFO L471 AbstractCegarLoop]: Abstraction has 171983 states and 177113 transitions. [2025-03-03 10:35:56,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:35:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 171983 states and 177113 transitions. [2025-03-03 10:35:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2025-03-03 10:35:57,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:57,013 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:57,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:35:57,013 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:57,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash -729574481, now seen corresponding path program 1 times [2025-03-03 10:35:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:57,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94366878] [2025-03-03 10:35:57,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:57,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-03-03 10:35:57,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-03-03 10:35:57,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:57,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-03 10:35:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:58,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94366878] [2025-03-03 10:35:58,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94366878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:58,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:58,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:35:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325590998] [2025-03-03 10:35:58,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:58,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:35:58,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:58,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:35:58,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:35:58,145 INFO L87 Difference]: Start difference. First operand 171983 states and 177113 transitions. Second operand has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 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)