./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label59.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_label59.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 51dcd89c10622c543bf9ef783ec22401c3170140113dd2b2907b165950bd75af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:40:01,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:40:01,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:40:01,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:40:01,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:40:01,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:40:01,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:40:01,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:40:01,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:40:01,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:40:01,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:40:01,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:40:01,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:40:01,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:40:01,770 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:40:01,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:40:01,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:40:01,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:40:01,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:40:01,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:40:01,773 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 -> 51dcd89c10622c543bf9ef783ec22401c3170140113dd2b2907b165950bd75af [2025-03-03 10:40:01,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:40:02,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:40:02,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:40:02,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:40:02,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:40:02,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label59.c [2025-03-03 10:40:03,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4deeec5a/9265a07acc5b4deaaaed6108ec317ce7/FLAG6eed56879 [2025-03-03 10:40:03,643 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:40:03,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label59.c [2025-03-03 10:40:03,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4deeec5a/9265a07acc5b4deaaaed6108ec317ce7/FLAG6eed56879 [2025-03-03 10:40:03,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4deeec5a/9265a07acc5b4deaaaed6108ec317ce7 [2025-03-03 10:40:03,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:40:03,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:40:03,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:40:03,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:40:03,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:40:03,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:03" (1/1) ... [2025-03-03 10:40:03,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f6f35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:03, skipping insertion in model container [2025-03-03 10:40:03,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:03" (1/1) ... [2025-03-03 10:40:03,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:40:03,986 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_label59.c[5577,5590] [2025-03-03 10:40:04,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:40:04,555 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:40:04,571 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_label59.c[5577,5590] [2025-03-03 10:40:04,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:40:04,835 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:40:04,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04 WrapperNode [2025-03-03 10:40:04,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:40:04,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:40:04,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:40:04,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:40:04,841 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:40:04" (1/1) ... [2025-03-03 10:40:04,886 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:40:04" (1/1) ... [2025-03-03 10:40:05,117 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:40:05,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:40:05,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:40:05,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:40:05,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:40:05,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,254 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:40:05,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:40:05,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:40:05,475 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:40:05,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:40:05,476 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (1/1) ... [2025-03-03 10:40:05,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:40:05,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:40:05,502 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:40:05,505 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:40:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:40:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:40:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:40:05,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:40:05,572 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:40:05,574 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:40:08,772 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:40:08,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:40:08,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:40:08,934 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:40:08,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:40:08,962 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:40:08,962 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:40:08,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:08 BoogieIcfgContainer [2025-03-03 10:40:08,963 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:40:08,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:40:08,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:40:08,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:40:08,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:40:03" (1/3) ... [2025-03-03 10:40:08,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7154c7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:08, skipping insertion in model container [2025-03-03 10:40:08,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:04" (2/3) ... [2025-03-03 10:40:08,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7154c7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:08, skipping insertion in model container [2025-03-03 10:40:08,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:08" (3/3) ... [2025-03-03 10:40:08,970 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label59.c [2025-03-03 10:40:08,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:40:08,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label59.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:40:09,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:40:09,097 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;@c72ab7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:40:09,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:40:09,105 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:40:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 10:40:09,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:09,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:09,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:09,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash -282227835, now seen corresponding path program 1 times [2025-03-03 10:40:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242678194] [2025-03-03 10:40:09,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:09,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 10:40:09,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 10:40:09,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:09,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:09,389 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:40:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:09,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242678194] [2025-03-03 10:40:09,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242678194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:09,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:09,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:09,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826356095] [2025-03-03 10:40:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:09,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:09,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:09,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:09,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:09,412 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 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:12,043 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-03-03 10:40:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:12,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-03 10:40:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:12,066 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 10:40:12,066 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:40:12,070 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:40:12,073 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 792 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:12,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 112 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:40:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:40:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:40:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.86578073089701) internal successors, (2808), 1505 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2808 transitions. [2025-03-03 10:40:12,159 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2808 transitions. Word has length 44 [2025-03-03 10:40:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:12,160 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2808 transitions. [2025-03-03 10:40:12,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:12,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2808 transitions. [2025-03-03 10:40:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 10:40:12,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:12,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:40:12,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:40:12,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:12,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1520006424, now seen corresponding path program 1 times [2025-03-03 10:40:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:12,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307765603] [2025-03-03 10:40:12,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:12,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 10:40:12,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 10:40:12,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:12,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:12,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307765603] [2025-03-03 10:40:12,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307765603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:12,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:12,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:12,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90937303] [2025-03-03 10:40:12,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:12,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:12,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:12,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:12,357 INFO L87 Difference]: Start difference. First operand 1506 states and 2808 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:14,789 INFO L93 Difference]: Finished difference Result 4514 states and 8420 transitions. [2025-03-03 10:40:14,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:14,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 10:40:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:14,800 INFO L225 Difference]: With dead ends: 4514 [2025-03-03 10:40:14,800 INFO L226 Difference]: Without dead ends: 3010 [2025-03-03 10:40:14,804 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:40:14,805 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 926 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:14,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 353 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:40:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-03-03 10:40:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2025-03-03 10:40:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.6511473229132025) internal successors, (4965), 3007 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4965 transitions. [2025-03-03 10:40:14,865 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4965 transitions. Word has length 109 [2025-03-03 10:40:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:14,867 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4965 transitions. [2025-03-03 10:40:14,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4965 transitions. [2025-03-03 10:40:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 10:40:14,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:14,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:40:14,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:40:14,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:14,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash 647078345, now seen corresponding path program 1 times [2025-03-03 10:40:14,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:14,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063800934] [2025-03-03 10:40:14,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:14,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:14,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 10:40:14,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 10:40:14,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:14,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:15,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:15,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063800934] [2025-03-03 10:40:15,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063800934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:15,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:15,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187272956] [2025-03-03 10:40:15,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:15,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:40:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:15,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:40:15,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:40:15,188 INFO L87 Difference]: Start difference. First operand 3008 states and 4965 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:17,553 INFO L93 Difference]: Finished difference Result 7555 states and 12123 transitions. [2025-03-03 10:40:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:40:17,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-03 10:40:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:17,567 INFO L225 Difference]: With dead ends: 7555 [2025-03-03 10:40:17,568 INFO L226 Difference]: Without dead ends: 4512 [2025-03-03 10:40:17,572 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:40:17,573 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 705 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:17,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 606 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:40:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2025-03-03 10:40:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4510. [2025-03-03 10:40:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.4515413617210025) internal successors, (6545), 4509 states have internal predecessors, (6545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 6545 transitions. [2025-03-03 10:40:17,645 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 6545 transitions. Word has length 115 [2025-03-03 10:40:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:17,646 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 6545 transitions. [2025-03-03 10:40:17,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 6545 transitions. [2025-03-03 10:40:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 10:40:17,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:17,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:40:17,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:40:17,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:17,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash 762552995, now seen corresponding path program 1 times [2025-03-03 10:40:17,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:17,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153468821] [2025-03-03 10:40:17,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:17,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:17,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 10:40:17,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 10:40:17,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:17,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:17,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:17,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153468821] [2025-03-03 10:40:17,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153468821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:17,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:17,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:17,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224794307] [2025-03-03 10:40:17,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:17,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:40:17,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:17,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:40:17,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:40:17,893 INFO L87 Difference]: Start difference. First operand 4510 states and 6545 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:21,016 INFO L93 Difference]: Finished difference Result 14283 states and 20463 transitions. [2025-03-03 10:40:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:40:21,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-03 10:40:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:21,038 INFO L225 Difference]: With dead ends: 14283 [2025-03-03 10:40:21,038 INFO L226 Difference]: Without dead ends: 9775 [2025-03-03 10:40:21,041 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:40:21,042 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 2132 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:21,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 381 Invalid, 4619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:40:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9775 states. [2025-03-03 10:40:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9775 to 9767. [2025-03-03 10:40:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3656563587958221) internal successors, (13337), 9766 states have internal predecessors, (13337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 13337 transitions. [2025-03-03 10:40:21,163 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 13337 transitions. Word has length 160 [2025-03-03 10:40:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:21,164 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 13337 transitions. [2025-03-03 10:40:21,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 13337 transitions. [2025-03-03 10:40:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 10:40:21,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:21,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:40:21,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:40:21,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:21,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash -541700528, now seen corresponding path program 1 times [2025-03-03 10:40:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:21,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258055587] [2025-03-03 10:40:21,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:21,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 10:40:21,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 10:40:21,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:21,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:21,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:21,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258055587] [2025-03-03 10:40:21,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258055587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:21,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990752364] [2025-03-03 10:40:21,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:21,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:21,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:21,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:21,409 INFO L87 Difference]: Start difference. First operand 9767 states and 13337 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:23,641 INFO L93 Difference]: Finished difference Result 25540 states and 35956 transitions. [2025-03-03 10:40:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:23,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2025-03-03 10:40:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:23,672 INFO L225 Difference]: With dead ends: 25540 [2025-03-03 10:40:23,672 INFO L226 Difference]: Without dead ends: 15775 [2025-03-03 10:40:23,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:23,681 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 734 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:23,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1280 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:40:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2025-03-03 10:40:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15775. [2025-03-03 10:40:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.301572207429948) internal successors, (20531), 15774 states have internal predecessors, (20531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 20531 transitions. [2025-03-03 10:40:23,866 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 20531 transitions. Word has length 189 [2025-03-03 10:40:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:23,867 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 20531 transitions. [2025-03-03 10:40:23,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 20531 transitions. [2025-03-03 10:40:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-03 10:40:23,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:23,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:23,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:40:23,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:23,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1919703508, now seen corresponding path program 1 times [2025-03-03 10:40:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:23,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840423748] [2025-03-03 10:40:23,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:23,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:23,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 10:40:23,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 10:40:23,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:23,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:40:24,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840423748] [2025-03-03 10:40:24,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840423748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:24,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:24,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:24,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460714423] [2025-03-03 10:40:24,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:24,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:40:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:24,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:40:24,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:40:24,200 INFO L87 Difference]: Start difference. First operand 15775 states and 20531 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:26,624 INFO L93 Difference]: Finished difference Result 31587 states and 41098 transitions. [2025-03-03 10:40:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:40:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 256 [2025-03-03 10:40:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:26,650 INFO L225 Difference]: With dead ends: 31587 [2025-03-03 10:40:26,650 INFO L226 Difference]: Without dead ends: 15777 [2025-03-03 10:40:26,663 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:40:26,665 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:26,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 402 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:40:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15777 states. [2025-03-03 10:40:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15777 to 15775. [2025-03-03 10:40:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2801445416508177) internal successors, (20193), 15774 states have internal predecessors, (20193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 20193 transitions. [2025-03-03 10:40:26,824 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 20193 transitions. Word has length 256 [2025-03-03 10:40:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:26,825 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 20193 transitions. [2025-03-03 10:40:26,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 20193 transitions. [2025-03-03 10:40:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 10:40:26,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:26,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:26,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:40:26,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:26,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:26,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1910478354, now seen corresponding path program 1 times [2025-03-03 10:40:26,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:26,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4765813] [2025-03-03 10:40:26,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:26,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:26,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 10:40:26,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 10:40:26,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:26,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-03 10:40:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4765813] [2025-03-03 10:40:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4765813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:26,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489122763] [2025-03-03 10:40:26,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:26,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:26,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:26,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:26,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:26,984 INFO L87 Difference]: Start difference. First operand 15775 states and 20193 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:29,056 INFO L93 Difference]: Finished difference Result 44315 states and 57309 transitions. [2025-03-03 10:40:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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 265 [2025-03-03 10:40:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:29,102 INFO L225 Difference]: With dead ends: 44315 [2025-03-03 10:40:29,102 INFO L226 Difference]: Without dead ends: 28542 [2025-03-03 10:40:29,119 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:40:29,121 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 652 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 815 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 815 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:29,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 524 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [815 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:40:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28542 states. [2025-03-03 10:40:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28542 to 23285. [2025-03-03 10:40:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.2308022676516062) internal successors, (28658), 23284 states have internal predecessors, (28658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 28658 transitions. [2025-03-03 10:40:29,424 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 28658 transitions. Word has length 265 [2025-03-03 10:40:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:29,424 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 28658 transitions. [2025-03-03 10:40:29,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 28658 transitions. [2025-03-03 10:40:29,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-03 10:40:29,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:29,430 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:40:29,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:40:29,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:29,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1454166008, now seen corresponding path program 1 times [2025-03-03 10:40:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613702357] [2025-03-03 10:40:29,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:29,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:29,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 10:40:29,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 10:40:29,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:29,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:40:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613702357] [2025-03-03 10:40:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613702357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:29,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:29,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269620387] [2025-03-03 10:40:29,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:29,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:29,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:29,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:29,806 INFO L87 Difference]: Start difference. First operand 23285 states and 28658 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:32,129 INFO L93 Difference]: Finished difference Result 60837 states and 75914 transitions. [2025-03-03 10:40:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2025-03-03 10:40:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:32,177 INFO L225 Difference]: With dead ends: 60837 [2025-03-03 10:40:32,178 INFO L226 Difference]: Without dead ends: 37554 [2025-03-03 10:40:32,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:32,198 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 793 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 912 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:32,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 105 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [912 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:40:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2025-03-03 10:40:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 34550. [2025-03-03 10:40:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34550 states, 34549 states have (on average 1.2429013864366552) internal successors, (42941), 34549 states have internal predecessors, (42941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34550 states to 34550 states and 42941 transitions. [2025-03-03 10:40:32,597 INFO L78 Accepts]: Start accepts. Automaton has 34550 states and 42941 transitions. Word has length 344 [2025-03-03 10:40:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:32,598 INFO L471 AbstractCegarLoop]: Abstraction has 34550 states and 42941 transitions. [2025-03-03 10:40:32,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 34550 states and 42941 transitions. [2025-03-03 10:40:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-03 10:40:32,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:32,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:40:32,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:40:32,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:32,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash 249239533, now seen corresponding path program 1 times [2025-03-03 10:40:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:32,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290490306] [2025-03-03 10:40:32,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 10:40:32,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 10:40:32,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:32,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:40:32,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:32,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290490306] [2025-03-03 10:40:32,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290490306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:32,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:32,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895887129] [2025-03-03 10:40:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:32,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:32,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:32,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:32,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:32,992 INFO L87 Difference]: Start difference. First operand 34550 states and 42941 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:35,344 INFO L93 Difference]: Finished difference Result 78110 states and 97615 transitions. [2025-03-03 10:40:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 361 [2025-03-03 10:40:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:35,401 INFO L225 Difference]: With dead ends: 78110 [2025-03-03 10:40:35,402 INFO L226 Difference]: Without dead ends: 43562 [2025-03-03 10:40:35,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:35,429 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 797 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 977 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 977 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:35,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 147 Invalid, 3006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [977 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:40:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43562 states. [2025-03-03 10:40:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43562 to 43562. [2025-03-03 10:40:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43562 states, 43561 states have (on average 1.2146185808406602) internal successors, (52910), 43561 states have internal predecessors, (52910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43562 states to 43562 states and 52910 transitions. [2025-03-03 10:40:35,779 INFO L78 Accepts]: Start accepts. Automaton has 43562 states and 52910 transitions. Word has length 361 [2025-03-03 10:40:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:35,779 INFO L471 AbstractCegarLoop]: Abstraction has 43562 states and 52910 transitions. [2025-03-03 10:40:35,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 43562 states and 52910 transitions. [2025-03-03 10:40:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 10:40:35,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:35,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-03 10:40:35,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:40:35,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:35,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1449233394, now seen corresponding path program 1 times [2025-03-03 10:40:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:35,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774739208] [2025-03-03 10:40:35,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:35,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:35,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 10:40:35,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 10:40:35,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:35,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 101 proven. 24 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 10:40:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774739208] [2025-03-03 10:40:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774739208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:40:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348108024] [2025-03-03 10:40:36,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:36,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:40:36,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:40:36,125 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:40:36,127 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:40:36,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 10:40:36,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 10:40:36,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:36,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:36,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:40:36,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:40:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 10:40:36,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:40:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348108024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:36,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:40:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:40:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364865418] [2025-03-03 10:40:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:36,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:36,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:36,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:36,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:40:36,321 INFO L87 Difference]: Start difference. First operand 43562 states and 52910 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:38,549 INFO L93 Difference]: Finished difference Result 94632 states and 114283 transitions. [2025-03-03 10:40:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:38,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 372 [2025-03-03 10:40:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:38,596 INFO L225 Difference]: With dead ends: 94632 [2025-03-03 10:40:38,596 INFO L226 Difference]: Without dead ends: 48068 [2025-03-03 10:40:38,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 371 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:40:38,610 INFO L435 NwaCegarLoop]: 1392 mSDtfsCounter, 710 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:38,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1400 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:40:38,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48068 states. [2025-03-03 10:40:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 48068. [2025-03-03 10:40:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48068 states, 48067 states have (on average 1.1855326939480308) internal successors, (56985), 48067 states have internal predecessors, (56985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48068 states to 48068 states and 56985 transitions. [2025-03-03 10:40:39,008 INFO L78 Accepts]: Start accepts. Automaton has 48068 states and 56985 transitions. Word has length 372 [2025-03-03 10:40:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:39,008 INFO L471 AbstractCegarLoop]: Abstraction has 48068 states and 56985 transitions. [2025-03-03 10:40:39,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 48068 states and 56985 transitions. [2025-03-03 10:40:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-03 10:40:39,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:39,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:39,018 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:40:39,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 10:40:39,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:39,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:39,214 INFO L85 PathProgramCache]: Analyzing trace with hash 429183350, now seen corresponding path program 1 times [2025-03-03 10:40:39,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:39,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872984322] [2025-03-03 10:40:39,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:39,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:39,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-03 10:40:39,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-03 10:40:39,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:39,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-03 10:40:39,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:39,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872984322] [2025-03-03 10:40:39,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872984322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:39,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:39,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871042924] [2025-03-03 10:40:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:39,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:39,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:39,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:39,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:39,344 INFO L87 Difference]: Start difference. First operand 48068 states and 56985 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:41,544 INFO L93 Difference]: Finished difference Result 120917 states and 143008 transitions. [2025-03-03 10:40:41,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:41,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 403 [2025-03-03 10:40:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:41,616 INFO L225 Difference]: With dead ends: 120917 [2025-03-03 10:40:41,616 INFO L226 Difference]: Without dead ends: 72851 [2025-03-03 10:40:41,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:41,652 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 733 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:41,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 170 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:40:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72851 states. [2025-03-03 10:40:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72851 to 69096. [2025-03-03 10:40:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69096 states, 69095 states have (on average 1.1746580794558217) internal successors, (81163), 69095 states have internal predecessors, (81163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69096 states to 69096 states and 81163 transitions. [2025-03-03 10:40:42,424 INFO L78 Accepts]: Start accepts. Automaton has 69096 states and 81163 transitions. Word has length 403 [2025-03-03 10:40:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:42,424 INFO L471 AbstractCegarLoop]: Abstraction has 69096 states and 81163 transitions. [2025-03-03 10:40:42,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 69096 states and 81163 transitions. [2025-03-03 10:40:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-03 10:40:42,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:42,431 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:42,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:40:42,431 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:42,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -283442712, now seen corresponding path program 1 times [2025-03-03 10:40:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:42,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341850809] [2025-03-03 10:40:42,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:42,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-03 10:40:42,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-03 10:40:42,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:42,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 10:40:42,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:42,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341850809] [2025-03-03 10:40:42,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341850809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:42,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:42,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:42,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185554073] [2025-03-03 10:40:42,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:42,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:42,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:42,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:42,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:42,631 INFO L87 Difference]: Start difference. First operand 69096 states and 81163 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:45,063 INFO L93 Difference]: Finished difference Result 168981 states and 198076 transitions. [2025-03-03 10:40:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 423 [2025-03-03 10:40:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:45,166 INFO L225 Difference]: With dead ends: 168981 [2025-03-03 10:40:45,166 INFO L226 Difference]: Without dead ends: 99136 [2025-03-03 10:40:45,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:45,193 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 798 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:45,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1047 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:40:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99136 states. [2025-03-03 10:40:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99136 to 85618. [2025-03-03 10:40:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85618 states, 85617 states have (on average 1.1317845754931848) internal successors, (96900), 85617 states have internal predecessors, (96900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85618 states to 85618 states and 96900 transitions. [2025-03-03 10:40:46,090 INFO L78 Accepts]: Start accepts. Automaton has 85618 states and 96900 transitions. Word has length 423 [2025-03-03 10:40:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:46,090 INFO L471 AbstractCegarLoop]: Abstraction has 85618 states and 96900 transitions. [2025-03-03 10:40:46,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 85618 states and 96900 transitions. [2025-03-03 10:40:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-03 10:40:46,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:46,095 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:40:46,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:40:46,095 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:46,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash 267090504, now seen corresponding path program 1 times [2025-03-03 10:40:46,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:46,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967968794] [2025-03-03 10:40:46,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:46,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:46,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-03 10:40:46,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-03 10:40:46,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:46,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 337 proven. 14 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 10:40:46,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967968794] [2025-03-03 10:40:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967968794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:40:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84469573] [2025-03-03 10:40:46,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:46,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:40:46,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:40:46,671 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:40:46,673 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:40:46,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-03 10:40:46,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-03 10:40:46,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:46,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:46,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:40:46,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:40:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-03 10:40:46,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:40:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84469573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:46,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:40:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:40:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769099175] [2025-03-03 10:40:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:46,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:46,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:46,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:40:46,931 INFO L87 Difference]: Start difference. First operand 85618 states and 96900 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:49,134 INFO L93 Difference]: Finished difference Result 170483 states and 193042 transitions. [2025-03-03 10:40:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:49,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 427 [2025-03-03 10:40:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:49,216 INFO L225 Difference]: With dead ends: 170483 [2025-03-03 10:40:49,216 INFO L226 Difference]: Without dead ends: 85618 [2025-03-03 10:40:49,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:40:49,256 INFO L435 NwaCegarLoop]: 1270 mSDtfsCounter, 747 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:49,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1278 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:40:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85618 states. [2025-03-03 10:40:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85618 to 75855. [2025-03-03 10:40:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75855 states, 75854 states have (on average 1.1084583542067656) internal successors, (84081), 75854 states have internal predecessors, (84081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75855 states to 75855 states and 84081 transitions. [2025-03-03 10:40:50,125 INFO L78 Accepts]: Start accepts. Automaton has 75855 states and 84081 transitions. Word has length 427 [2025-03-03 10:40:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:50,126 INFO L471 AbstractCegarLoop]: Abstraction has 75855 states and 84081 transitions. [2025-03-03 10:40:50,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 75855 states and 84081 transitions. [2025-03-03 10:40:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-03 10:40:50,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:50,133 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:50,140 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:40:50,334 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,SelfDestructingSolverStorable12 [2025-03-03 10:40:50,334 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:50,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1736031296, now seen corresponding path program 1 times [2025-03-03 10:40:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:50,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418573904] [2025-03-03 10:40:50,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:50,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:50,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 10:40:50,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 10:40:50,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:50,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-03 10:40:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418573904] [2025-03-03 10:40:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418573904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:50,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101283895] [2025-03-03 10:40:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:50,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:50,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:50,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:50,584 INFO L87 Difference]: Start difference. First operand 75855 states and 84081 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:53,278 INFO L93 Difference]: Finished difference Result 171985 states and 189506 transitions. [2025-03-03 10:40:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:53,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 456 [2025-03-03 10:40:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:53,380 INFO L225 Difference]: With dead ends: 171985 [2025-03-03 10:40:53,380 INFO L226 Difference]: Without dead ends: 96883 [2025-03-03 10:40:53,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:53,423 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 653 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:53,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1230 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:40:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96883 states. [2025-03-03 10:40:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96883 to 92377. [2025-03-03 10:40:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92377 states, 92376 states have (on average 1.0921776218931325) internal successors, (100891), 92376 states have internal predecessors, (100891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92377 states to 92377 states and 100891 transitions. [2025-03-03 10:40:54,305 INFO L78 Accepts]: Start accepts. Automaton has 92377 states and 100891 transitions. Word has length 456 [2025-03-03 10:40:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:54,306 INFO L471 AbstractCegarLoop]: Abstraction has 92377 states and 100891 transitions. [2025-03-03 10:40:54,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 92377 states and 100891 transitions. [2025-03-03 10:40:54,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-03 10:40:54,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:54,312 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:54,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:40:54,312 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:54,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash 690086528, now seen corresponding path program 1 times [2025-03-03 10:40:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:54,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359122197] [2025-03-03 10:40:54,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:54,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:54,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 10:40:54,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 10:40:54,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:54,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 575 proven. 14 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:40:54,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:54,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359122197] [2025-03-03 10:40:54,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359122197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:40:54,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051640763] [2025-03-03 10:40:54,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:54,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:40:54,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:40:54,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:40:54,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:40:54,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 10:40:54,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 10:40:54,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:54,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:54,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:40:54,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:40:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-03 10:40:55,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:40:55,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051640763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:55,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:40:55,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:40:55,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847220170] [2025-03-03 10:40:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:55,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:55,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:55,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:55,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:40:55,081 INFO L87 Difference]: Start difference. First operand 92377 states and 100891 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:57,300 INFO L93 Difference]: Finished difference Result 184001 states and 201024 transitions. [2025-03-03 10:40:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:57,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 507 [2025-03-03 10:40:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:57,403 INFO L225 Difference]: With dead ends: 184001 [2025-03-03 10:40:57,404 INFO L226 Difference]: Without dead ends: 92377 [2025-03-03 10:40:57,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:40:57,460 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 737 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:57,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 383 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:40:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92377 states. [2025-03-03 10:40:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92377 to 89373. [2025-03-03 10:40:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89373 states, 89372 states have (on average 1.0771046860314193) internal successors, (96263), 89372 states have internal predecessors, (96263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89373 states to 89373 states and 96263 transitions. [2025-03-03 10:40:58,692 INFO L78 Accepts]: Start accepts. Automaton has 89373 states and 96263 transitions. Word has length 507 [2025-03-03 10:40:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:58,693 INFO L471 AbstractCegarLoop]: Abstraction has 89373 states and 96263 transitions. [2025-03-03 10:40:58,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 89373 states and 96263 transitions. [2025-03-03 10:40:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-03-03 10:40:58,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:58,699 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:40:58,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:40:58,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:40:58,899 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:58,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash -368144942, now seen corresponding path program 1 times [2025-03-03 10:40:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:58,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023298686] [2025-03-03 10:40:58,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:58,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:58,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-03 10:40:58,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-03 10:40:58,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:58,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-03 10:40:59,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:59,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023298686] [2025-03-03 10:40:59,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023298686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:59,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:59,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:59,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229182745] [2025-03-03 10:40:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:59,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:59,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:59,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:59,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:59,229 INFO L87 Difference]: Start difference. First operand 89373 states and 96263 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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:41:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:01,326 INFO L93 Difference]: Finished difference Result 177993 states and 191768 transitions. [2025-03-03 10:41:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:01,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 508 [2025-03-03 10:41:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:01,414 INFO L225 Difference]: With dead ends: 177993 [2025-03-03 10:41:01,415 INFO L226 Difference]: Without dead ends: 89373 [2025-03-03 10:41:01,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:01,444 INFO L435 NwaCegarLoop]: 1201 mSDtfsCounter, 729 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:01,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1209 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:41:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89373 states. [2025-03-03 10:41:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89373 to 88622. [2025-03-03 10:41:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88622 states, 88621 states have (on average 1.065650353753625) internal successors, (94439), 88621 states have internal predecessors, (94439), 0 states have call successors, (0), 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:41:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88622 states to 88622 states and 94439 transitions. [2025-03-03 10:41:02,262 INFO L78 Accepts]: Start accepts. Automaton has 88622 states and 94439 transitions. Word has length 508 [2025-03-03 10:41:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:02,263 INFO L471 AbstractCegarLoop]: Abstraction has 88622 states and 94439 transitions. [2025-03-03 10:41:02,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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:41:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 88622 states and 94439 transitions. [2025-03-03 10:41:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-03 10:41:02,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:02,270 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:02,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:41:02,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:02,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash 501362809, now seen corresponding path program 1 times [2025-03-03 10:41:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313625787] [2025-03-03 10:41:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:02,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 10:41:02,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 10:41:02,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:02,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-03 10:41:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313625787] [2025-03-03 10:41:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313625787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:02,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:02,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:02,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874014180] [2025-03-03 10:41:02,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:02,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:02,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:02,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:02,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:02,634 INFO L87 Difference]: Start difference. First operand 88622 states and 94439 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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:41:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:05,366 INFO L93 Difference]: Finished difference Result 221551 states and 237108 transitions. [2025-03-03 10:41:05,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:05,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 528 [2025-03-03 10:41:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:05,508 INFO L225 Difference]: With dead ends: 221551 [2025-03-03 10:41:05,509 INFO L226 Difference]: Without dead ends: 133682 [2025-03-03 10:41:05,549 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:41:05,549 INFO L435 NwaCegarLoop]: 1188 mSDtfsCounter, 756 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:05,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1196 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:41:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133682 states. [2025-03-03 10:41:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133682 to 129927. [2025-03-03 10:41:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129927 states, 129926 states have (on average 1.0635515601188368) internal successors, (138183), 129926 states have internal predecessors, (138183), 0 states have call successors, (0), 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:41:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129927 states to 129927 states and 138183 transitions. [2025-03-03 10:41:06,963 INFO L78 Accepts]: Start accepts. Automaton has 129927 states and 138183 transitions. Word has length 528 [2025-03-03 10:41:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 129927 states and 138183 transitions. [2025-03-03 10:41:06,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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:41:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 129927 states and 138183 transitions. [2025-03-03 10:41:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-03 10:41:06,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:06,973 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 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] [2025-03-03 10:41:06,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:41:06,973 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:06,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash 155162781, now seen corresponding path program 1 times [2025-03-03 10:41:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496936408] [2025-03-03 10:41:06,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:07,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-03 10:41:07,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-03 10:41:07,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:07,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-03 10:41:07,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:07,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496936408] [2025-03-03 10:41:07,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496936408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:07,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:07,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:07,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823539607] [2025-03-03 10:41:07,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:07,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:07,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:07,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:07,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:07,352 INFO L87 Difference]: Start difference. First operand 129927 states and 138183 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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:41:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:09,791 INFO L93 Difference]: Finished difference Result 259852 states and 276362 transitions. [2025-03-03 10:41:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 597 [2025-03-03 10:41:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:09,950 INFO L225 Difference]: With dead ends: 259852 [2025-03-03 10:41:09,950 INFO L226 Difference]: Without dead ends: 129927 [2025-03-03 10:41:10,005 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:41:10,006 INFO L435 NwaCegarLoop]: 1198 mSDtfsCounter, 670 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:10,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1206 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:41:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129927 states. [2025-03-03 10:41:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129927 to 120915. [2025-03-03 10:41:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120915 states, 120914 states have (on average 1.0504656201928644) internal successors, (127016), 120914 states have internal predecessors, (127016), 0 states have call successors, (0), 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:41:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120915 states to 120915 states and 127016 transitions. [2025-03-03 10:41:11,586 INFO L78 Accepts]: Start accepts. Automaton has 120915 states and 127016 transitions. Word has length 597 [2025-03-03 10:41:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:11,586 INFO L471 AbstractCegarLoop]: Abstraction has 120915 states and 127016 transitions. [2025-03-03 10:41:11,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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:41:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 120915 states and 127016 transitions. [2025-03-03 10:41:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-03 10:41:11,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:11,602 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:11,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:41:11,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:11,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash 42274259, now seen corresponding path program 1 times [2025-03-03 10:41:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856623352] [2025-03-03 10:41:11,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:11,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-03 10:41:11,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-03 10:41:11,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:11,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2025-03-03 10:41:11,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:11,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856623352] [2025-03-03 10:41:11,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856623352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:11,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:11,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:11,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958550534] [2025-03-03 10:41:11,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:11,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:11,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:11,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:11,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:11,854 INFO L87 Difference]: Start difference. First operand 120915 states and 127016 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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:41:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:14,851 INFO L93 Difference]: Finished difference Result 283133 states and 298292 transitions. [2025-03-03 10:41:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:14,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 645 [2025-03-03 10:41:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:15,023 INFO L225 Difference]: With dead ends: 283133 [2025-03-03 10:41:15,023 INFO L226 Difference]: Without dead ends: 162971 [2025-03-03 10:41:15,056 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:41:15,057 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 772 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:15,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1117 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:41:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162971 states. [2025-03-03 10:41:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162971 to 157714. [2025-03-03 10:41:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157714 states, 157713 states have (on average 1.0542060578392396) internal successors, (166262), 157713 states have internal predecessors, (166262), 0 states have call successors, (0), 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:41:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157714 states to 157714 states and 166262 transitions. [2025-03-03 10:41:17,028 INFO L78 Accepts]: Start accepts. Automaton has 157714 states and 166262 transitions. Word has length 645 [2025-03-03 10:41:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:17,028 INFO L471 AbstractCegarLoop]: Abstraction has 157714 states and 166262 transitions. [2025-03-03 10:41:17,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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:41:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 157714 states and 166262 transitions. [2025-03-03 10:41:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 10:41:17,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:17,042 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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:41:17,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:41:17,042 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:17,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:17,043 INFO L85 PathProgramCache]: Analyzing trace with hash 510745712, now seen corresponding path program 1 times [2025-03-03 10:41:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749086881] [2025-03-03 10:41:17,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:17,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 10:41:17,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 10:41:17,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:17,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 846 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-03 10:41:17,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:17,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749086881] [2025-03-03 10:41:17,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749086881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:17,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:17,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:17,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904371052] [2025-03-03 10:41:17,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:17,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:17,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:17,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:17,281 INFO L87 Difference]: Start difference. First operand 157714 states and 166262 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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:41:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:19,527 INFO L93 Difference]: Finished difference Result 314675 states and 331766 transitions. [2025-03-03 10:41:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 680 [2025-03-03 10:41:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:19,911 INFO L225 Difference]: With dead ends: 314675 [2025-03-03 10:41:19,911 INFO L226 Difference]: Without dead ends: 157714 [2025-03-03 10:41:19,968 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:41:19,969 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 653 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:19,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 488 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:41:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157714 states. [2025-03-03 10:41:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157714 to 156963. [2025-03-03 10:41:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156963 states, 156962 states have (on average 1.051133395344096) internal successors, (164988), 156962 states have internal predecessors, (164988), 0 states have call successors, (0), 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:41:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156963 states to 156963 states and 164988 transitions. [2025-03-03 10:41:21,643 INFO L78 Accepts]: Start accepts. Automaton has 156963 states and 164988 transitions. Word has length 680 [2025-03-03 10:41:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:21,643 INFO L471 AbstractCegarLoop]: Abstraction has 156963 states and 164988 transitions. [2025-03-03 10:41:21,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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:41:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 156963 states and 164988 transitions. [2025-03-03 10:41:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-03 10:41:21,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:21,664 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:21,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:41:21,664 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:21,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash 683189862, now seen corresponding path program 1 times [2025-03-03 10:41:21,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:21,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426119217] [2025-03-03 10:41:21,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:21,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-03 10:41:21,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-03 10:41:21,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:21,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-03-03 10:41:22,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:22,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426119217] [2025-03-03 10:41:22,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426119217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:22,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:22,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:22,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262869968] [2025-03-03 10:41:22,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:22,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:22,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:22,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:22,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:22,243 INFO L87 Difference]: Start difference. First operand 156963 states and 164988 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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:41:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:25,098 INFO L93 Difference]: Finished difference Result 344717 states and 362821 transitions. [2025-03-03 10:41:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:25,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 684 [2025-03-03 10:41:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:25,321 INFO L225 Difference]: With dead ends: 344717 [2025-03-03 10:41:25,321 INFO L226 Difference]: Without dead ends: 188507 [2025-03-03 10:41:25,413 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:41:25,414 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 612 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:25,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1306 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:41:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188507 states. [2025-03-03 10:41:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188507 to 171983. [2025-03-03 10:41:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171983 states, 171982 states have (on average 1.0490749031875428) internal successors, (180422), 171982 states have internal predecessors, (180422), 0 states have call successors, (0), 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:41:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171983 states to 171983 states and 180422 transitions. [2025-03-03 10:41:27,376 INFO L78 Accepts]: Start accepts. Automaton has 171983 states and 180422 transitions. Word has length 684 [2025-03-03 10:41:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:27,376 INFO L471 AbstractCegarLoop]: Abstraction has 171983 states and 180422 transitions. [2025-03-03 10:41:27,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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:41:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 171983 states and 180422 transitions. [2025-03-03 10:41:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-03-03 10:41:27,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:27,392 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:27,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:41:27,393 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:27,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1461997151, now seen corresponding path program 1 times [2025-03-03 10:41:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:27,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863224456] [2025-03-03 10:41:27,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:27,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-03 10:41:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-03 10:41:27,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat