./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label26.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/Problem13_label26.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 f7d9d441800fd040181450c0920264f1b228689c17b8db097e43b17ec5ad46cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:42:49,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:42:49,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:42:49,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:42:49,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:42:49,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:42:49,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:42:49,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:42:49,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:42:49,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:42:49,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:42:49,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:42:49,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:42:49,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:42:49,164 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:42:49,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:42:49,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:42:49,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:42:49,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:42:49,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:42:49,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:42:49,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:42:49,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:42:49,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:42:49,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:42:49,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:42:49,166 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:42:49,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:42:49,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:42:49,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:42:49,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:42:49,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:42:49,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:42:49,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:42:49,167 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 -> f7d9d441800fd040181450c0920264f1b228689c17b8db097e43b17ec5ad46cc [2025-03-03 10:42:49,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:42:49,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:42:49,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:42:49,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:42:49,398 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:42:49,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label26.c [2025-03-03 10:42:50,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0563a3d8/aba780839b2541b38bb3527eb57a6958/FLAGdebab5e79 [2025-03-03 10:42:50,950 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:42:50,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label26.c [2025-03-03 10:42:50,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0563a3d8/aba780839b2541b38bb3527eb57a6958/FLAGdebab5e79 [2025-03-03 10:42:51,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0563a3d8/aba780839b2541b38bb3527eb57a6958 [2025-03-03 10:42:51,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:42:51,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:42:51,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:42:51,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:42:51,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:42:51,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:42:51" (1/1) ... [2025-03-03 10:42:51,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:51, skipping insertion in model container [2025-03-03 10:42:51,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:42:51" (1/1) ... [2025-03-03 10:42:51,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:42:51,408 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/Problem13_label26.c[5554,5567] [2025-03-03 10:42:51,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:42:52,003 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:42:52,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label26.c[5554,5567] [2025-03-03 10:42:52,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:42:52,344 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:42:52,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52 WrapperNode [2025-03-03 10:42:52,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:42:52,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:42:52,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:42:52,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:42:52,351 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:42:52" (1/1) ... [2025-03-03 10:42:52,400 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:42:52" (1/1) ... [2025-03-03 10:42:52,817 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:42:52,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:42:52,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:42:52,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:42:52,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:42:52,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:52,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:52,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:53,091 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:42:53,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:53,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:53,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:53,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:53,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:53,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:53,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:42:53,440 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:42:53,440 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:42:53,440 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:42:53,441 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (1/1) ... [2025-03-03 10:42:53,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:42:53,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:53,505 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:42:53,507 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:42:53,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:42:53,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:42:53,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:42:53,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:42:53,575 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:42:53,576 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:42:57,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:42:57,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:42:57,462 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:42:57,688 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:42:57,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:42:57,722 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:42:57,723 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:42:57,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:42:57 BoogieIcfgContainer [2025-03-03 10:42:57,723 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:42:57,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:42:57,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:42:57,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:42:57,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:42:51" (1/3) ... [2025-03-03 10:42:57,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80e36d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:42:57, skipping insertion in model container [2025-03-03 10:42:57,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:52" (2/3) ... [2025-03-03 10:42:57,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80e36d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:42:57, skipping insertion in model container [2025-03-03 10:42:57,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:42:57" (3/3) ... [2025-03-03 10:42:57,731 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label26.c [2025-03-03 10:42:57,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:42:57,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label26.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:42:57,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:42:57,820 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;@3659bcab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:42:57,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:42:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states 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:42:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 10:42:57,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:57,834 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] [2025-03-03 10:42:57,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:57,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash -83525906, now seen corresponding path program 1 times [2025-03-03 10:42:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718911253] [2025-03-03 10:42:57,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:57,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:57,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 10:42:57,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 10:42:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:57,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:58,094 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:42:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718911253] [2025-03-03 10:42:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718911253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:58,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:58,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:58,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318027220] [2025-03-03 10:42:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:58,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:58,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:58,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:58,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:58,118 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:43:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:01,698 INFO L93 Difference]: Finished difference Result 3082 states and 5686 transitions. [2025-03-03 10:43:01,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-03 10:43:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:01,726 INFO L225 Difference]: With dead ends: 3082 [2025-03-03 10:43:01,727 INFO L226 Difference]: Without dead ends: 1899 [2025-03-03 10:43:01,736 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:43:01,740 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1001 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:01,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 646 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 10:43:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-03-03 10:43:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2025-03-03 10:43:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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:43:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2025-03-03 10:43:01,861 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 38 [2025-03-03 10:43:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:01,862 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2025-03-03 10:43:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:43:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2025-03-03 10:43:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 10:43:01,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:01,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:01,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:43:01,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:01,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2002936697, now seen corresponding path program 1 times [2025-03-03 10:43:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:01,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557850568] [2025-03-03 10:43:01,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:01,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 10:43:01,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 10:43:01,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:01,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557850568] [2025-03-03 10:43:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557850568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:02,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:02,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980935683] [2025-03-03 10:43:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:02,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:02,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:02,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:02,301 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:43:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:05,523 INFO L93 Difference]: Finished difference Result 5437 states and 9566 transitions. [2025-03-03 10:43:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:05,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-03-03 10:43:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:05,534 INFO L225 Difference]: With dead ends: 5437 [2025-03-03 10:43:05,534 INFO L226 Difference]: Without dead ends: 3545 [2025-03-03 10:43:05,536 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:43:05,537 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:05,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 881 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:43:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2025-03-03 10:43:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3484. [2025-03-03 10:43:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3483 states have (on average 1.5865633074935401) internal successors, (5526), 3483 states have internal predecessors, (5526), 0 states have call successors, (0), 0 states 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:43:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5526 transitions. [2025-03-03 10:43:05,591 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5526 transitions. Word has length 103 [2025-03-03 10:43:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:05,592 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 5526 transitions. [2025-03-03 10:43:05,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:43:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5526 transitions. [2025-03-03 10:43:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 10:43:05,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:05,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:05,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:43:05,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:05,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1540328853, now seen corresponding path program 1 times [2025-03-03 10:43:05,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:05,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444460501] [2025-03-03 10:43:05,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:05,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:05,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 10:43:05,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 10:43:05,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:05,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:05,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:05,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444460501] [2025-03-03 10:43:05,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444460501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:05,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:05,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:05,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739760089] [2025-03-03 10:43:05,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:05,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:05,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:05,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:05,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:05,725 INFO L87 Difference]: Start difference. First operand 3484 states and 5526 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:08,232 INFO L93 Difference]: Finished difference Result 10138 states and 16134 transitions. [2025-03-03 10:43:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:08,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-03 10:43:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:08,250 INFO L225 Difference]: With dead ends: 10138 [2025-03-03 10:43:08,250 INFO L226 Difference]: Without dead ends: 6656 [2025-03-03 10:43:08,254 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:43:08,254 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 871 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:08,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1136 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:43:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2025-03-03 10:43:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6655. [2025-03-03 10:43:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 1.4171926660655245) internal successors, (9430), 6654 states have internal predecessors, (9430), 0 states have call successors, (0), 0 states 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:43:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9430 transitions. [2025-03-03 10:43:08,359 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9430 transitions. Word has length 104 [2025-03-03 10:43:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:08,360 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9430 transitions. [2025-03-03 10:43:08,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9430 transitions. [2025-03-03 10:43:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 10:43:08,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:08,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:08,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:43:08,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:08,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash 380306173, now seen corresponding path program 1 times [2025-03-03 10:43:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364911860] [2025-03-03 10:43:08,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:08,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 10:43:08,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 10:43:08,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:08,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:08,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:08,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364911860] [2025-03-03 10:43:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364911860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:08,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:08,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127738100] [2025-03-03 10:43:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:08,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:08,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:08,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:08,505 INFO L87 Difference]: Start difference. First operand 6655 states and 9430 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:43:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:11,451 INFO L93 Difference]: Finished difference Result 14120 states and 20673 transitions. [2025-03-03 10:43:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-03 10:43:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:11,468 INFO L225 Difference]: With dead ends: 14120 [2025-03-03 10:43:11,468 INFO L226 Difference]: Without dead ends: 7467 [2025-03-03 10:43:11,475 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:43:11,475 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 872 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:11,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1176 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:43:11,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2025-03-03 10:43:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7456. [2025-03-03 10:43:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3389671361502347) internal successors, (9982), 7455 states have internal predecessors, (9982), 0 states have call successors, (0), 0 states 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:43:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9982 transitions. [2025-03-03 10:43:11,568 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9982 transitions. Word has length 107 [2025-03-03 10:43:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:11,568 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9982 transitions. [2025-03-03 10:43:11,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:43:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9982 transitions. [2025-03-03 10:43:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 10:43:11,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:11,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:11,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:43:11,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:11,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -351682772, now seen corresponding path program 1 times [2025-03-03 10:43:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:11,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28375827] [2025-03-03 10:43:11,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:11,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:11,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 10:43:11,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 10:43:11,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:11,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28375827] [2025-03-03 10:43:11,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28375827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:11,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:11,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933119495] [2025-03-03 10:43:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:11,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:11,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:11,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:11,885 INFO L87 Difference]: Start difference. First operand 7456 states and 9982 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:43:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:13,894 INFO L93 Difference]: Finished difference Result 14123 states and 19150 transitions. [2025-03-03 10:43:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:13,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-03-03 10:43:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:13,910 INFO L225 Difference]: With dead ends: 14123 [2025-03-03 10:43:13,910 INFO L226 Difference]: Without dead ends: 7456 [2025-03-03 10:43:13,915 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:43:13,916 INFO L435 NwaCegarLoop]: 1086 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:13,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1215 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:43:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2025-03-03 10:43:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7456. [2025-03-03 10:43:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3362843729040912) internal successors, (9962), 7455 states have internal predecessors, (9962), 0 states have call successors, (0), 0 states 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:43:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9962 transitions. [2025-03-03 10:43:14,009 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9962 transitions. Word has length 149 [2025-03-03 10:43:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:14,010 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9962 transitions. [2025-03-03 10:43:14,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:43:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9962 transitions. [2025-03-03 10:43:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 10:43:14,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:14,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:14,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:43:14,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:14,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash -572090366, now seen corresponding path program 1 times [2025-03-03 10:43:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:14,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524444608] [2025-03-03 10:43:14,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:14,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 10:43:14,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 10:43:14,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:14,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 10:43:14,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:14,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524444608] [2025-03-03 10:43:14,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524444608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:14,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096311975] [2025-03-03 10:43:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:14,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:14,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:14,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:14,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:14,160 INFO L87 Difference]: Start difference. First operand 7456 states and 9962 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:43:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:16,666 INFO L93 Difference]: Finished difference Result 19656 states and 26991 transitions. [2025-03-03 10:43:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 163 [2025-03-03 10:43:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:16,692 INFO L225 Difference]: With dead ends: 19656 [2025-03-03 10:43:16,693 INFO L226 Difference]: Without dead ends: 12989 [2025-03-03 10:43:16,700 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:43:16,702 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 743 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:16,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1203 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:43:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12989 states. [2025-03-03 10:43:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12989 to 12972. [2025-03-03 10:43:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.235910878112713) internal successors, (16031), 12971 states have internal predecessors, (16031), 0 states have call successors, (0), 0 states 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:43:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16031 transitions. [2025-03-03 10:43:16,834 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16031 transitions. Word has length 163 [2025-03-03 10:43:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:16,834 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16031 transitions. [2025-03-03 10:43:16,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:43:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16031 transitions. [2025-03-03 10:43:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-03 10:43:16,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:16,840 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:16,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:43:16,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:16,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 552139599, now seen corresponding path program 1 times [2025-03-03 10:43:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013498181] [2025-03-03 10:43:16,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:16,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-03 10:43:16,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-03 10:43:16,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:16,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:17,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:17,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013498181] [2025-03-03 10:43:17,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013498181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:17,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:17,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:43:17,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881329334] [2025-03-03 10:43:17,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:17,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:17,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:17,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:17,066 INFO L87 Difference]: Start difference. First operand 12972 states and 16031 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:19,930 INFO L93 Difference]: Finished difference Result 31480 states and 39986 transitions. [2025-03-03 10:43:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:19,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2025-03-03 10:43:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:19,958 INFO L225 Difference]: With dead ends: 31480 [2025-03-03 10:43:19,958 INFO L226 Difference]: Without dead ends: 19297 [2025-03-03 10:43: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:43:19,969 INFO L435 NwaCegarLoop]: 1777 mSDtfsCounter, 775 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 3268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:19,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1919 Invalid, 3268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:43:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19297 states. [2025-03-03 10:43:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19297 to 19273. [2025-03-03 10:43:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19273 states, 19272 states have (on average 1.1921959319219593) internal successors, (22976), 19272 states have internal predecessors, (22976), 0 states have call successors, (0), 0 states 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:43:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19273 states to 19273 states and 22976 transitions. [2025-03-03 10:43:20,127 INFO L78 Accepts]: Start accepts. Automaton has 19273 states and 22976 transitions. Word has length 250 [2025-03-03 10:43:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:20,127 INFO L471 AbstractCegarLoop]: Abstraction has 19273 states and 22976 transitions. [2025-03-03 10:43:20,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19273 states and 22976 transitions. [2025-03-03 10:43:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-03 10:43:20,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:20,130 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:20,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:43:20,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:20,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash 502209105, now seen corresponding path program 1 times [2025-03-03 10:43:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:20,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471660535] [2025-03-03 10:43:20,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:20,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:20,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 10:43:20,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 10:43:20,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:20,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:20,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471660535] [2025-03-03 10:43:20,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471660535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:20,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:20,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:43:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601253666] [2025-03-03 10:43:20,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:20,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:20,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:20,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:20,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:20,231 INFO L87 Difference]: Start difference. First operand 19273 states and 22976 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states 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:43:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:22,862 INFO L93 Difference]: Finished difference Result 53487 states and 64327 transitions. [2025-03-03 10:43:22,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:22,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-03-03 10:43:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:22,904 INFO L225 Difference]: With dead ends: 53487 [2025-03-03 10:43:22,904 INFO L226 Difference]: Without dead ends: 33425 [2025-03-03 10:43:22,919 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:43:22,919 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 953 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:22,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1810 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:43:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33425 states. [2025-03-03 10:43:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33425 to 31844. [2025-03-03 10:43:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31844 states, 31843 states have (on average 1.1619508212165939) internal successors, (37000), 31843 states have internal predecessors, (37000), 0 states have call successors, (0), 0 states 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:43:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31844 states to 31844 states and 37000 transitions. [2025-03-03 10:43:23,193 INFO L78 Accepts]: Start accepts. Automaton has 31844 states and 37000 transitions. Word has length 252 [2025-03-03 10:43:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:23,193 INFO L471 AbstractCegarLoop]: Abstraction has 31844 states and 37000 transitions. [2025-03-03 10:43:23,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states 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:43:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 31844 states and 37000 transitions. [2025-03-03 10:43:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-03 10:43:23,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:23,199 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:23,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:43:23,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:23,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1946898800, now seen corresponding path program 1 times [2025-03-03 10:43:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:23,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575188801] [2025-03-03 10:43:23,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:23,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-03 10:43:23,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-03 10:43:23,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:23,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 74 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:23,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:23,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575188801] [2025-03-03 10:43:23,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575188801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:43:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61889225] [2025-03-03 10:43:23,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:23,890 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:43:23,892 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:43:23,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-03 10:43:23,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-03 10:43:23,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:23,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:23,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:43:23,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:43:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:43:24,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:43:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61889225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:24,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:43:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:43:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991384888] [2025-03-03 10:43:24,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:24,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:24,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:24,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:43:24,065 INFO L87 Difference]: Start difference. First operand 31844 states and 37000 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:43:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:26,654 INFO L93 Difference]: Finished difference Result 62897 states and 73205 transitions. [2025-03-03 10:43:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:26,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 279 [2025-03-03 10:43:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:26,694 INFO L225 Difference]: With dead ends: 62897 [2025-03-03 10:43:26,694 INFO L226 Difference]: Without dead ends: 31842 [2025-03-03 10:43:26,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:43:26,715 INFO L435 NwaCegarLoop]: 1358 mSDtfsCounter, 1169 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:26,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 1439 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:43:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31842 states. [2025-03-03 10:43:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31842 to 31841. [2025-03-03 10:43:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31841 states, 31840 states have (on average 1.1251570351758795) internal successors, (35825), 31840 states have internal predecessors, (35825), 0 states have call successors, (0), 0 states 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:43:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31841 states to 31841 states and 35825 transitions. [2025-03-03 10:43:27,081 INFO L78 Accepts]: Start accepts. Automaton has 31841 states and 35825 transitions. Word has length 279 [2025-03-03 10:43:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:27,081 INFO L471 AbstractCegarLoop]: Abstraction has 31841 states and 35825 transitions. [2025-03-03 10:43:27,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:43:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 31841 states and 35825 transitions. [2025-03-03 10:43:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-03 10:43:27,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:27,085 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:27,092 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:43:27,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:27,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1532362119, now seen corresponding path program 1 times [2025-03-03 10:43:27,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:27,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050277555] [2025-03-03 10:43:27,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:27,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:27,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 10:43:27,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 10:43:27,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:27,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:43:27,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:27,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050277555] [2025-03-03 10:43:27,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050277555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:27,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:27,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:43:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470481263] [2025-03-03 10:43:27,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:27,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:27,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:27,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:27,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:27,479 INFO L87 Difference]: Start difference. First operand 31841 states and 35825 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:43:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:30,094 INFO L93 Difference]: Finished difference Result 74706 states and 85293 transitions. [2025-03-03 10:43:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 329 [2025-03-03 10:43:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:30,139 INFO L225 Difference]: With dead ends: 74706 [2025-03-03 10:43:30,139 INFO L226 Difference]: Without dead ends: 43654 [2025-03-03 10:43:30,162 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:43:30,162 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 825 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 3260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:30,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1942 Invalid, 3260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:43:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43654 states. [2025-03-03 10:43:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43654 to 42863. [2025-03-03 10:43:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42863 states, 42862 states have (on average 1.1091642947132658) internal successors, (47541), 42862 states have internal predecessors, (47541), 0 states have call successors, (0), 0 states 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:43:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42863 states to 42863 states and 47541 transitions. [2025-03-03 10:43:30,579 INFO L78 Accepts]: Start accepts. Automaton has 42863 states and 47541 transitions. Word has length 329 [2025-03-03 10:43:30,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:30,579 INFO L471 AbstractCegarLoop]: Abstraction has 42863 states and 47541 transitions. [2025-03-03 10:43:30,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:43:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 42863 states and 47541 transitions. [2025-03-03 10:43:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-03 10:43:30,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:30,583 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:30,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:43:30,583 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:30,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1039848891, now seen corresponding path program 1 times [2025-03-03 10:43:30,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:30,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929406617] [2025-03-03 10:43:30,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:30,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:30,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 10:43:30,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 10:43:30,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:30,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 203 proven. 110 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 10:43:31,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:31,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929406617] [2025-03-03 10:43:31,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929406617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:43:31,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788995561] [2025-03-03 10:43:31,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:31,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:31,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:31,225 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:43:31,227 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:43:31,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 10:43:31,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 10:43:31,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:31,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:31,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:43:31,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:43:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:43:31,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:43:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788995561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:31,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:43:31,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:43:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169318133] [2025-03-03 10:43:31,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:31,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:31,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:31,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:43:31,432 INFO L87 Difference]: Start difference. First operand 42863 states and 47541 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:43:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:33,781 INFO L93 Difference]: Finished difference Result 84928 states and 94280 transitions. [2025-03-03 10:43:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:33,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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:43:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:33,826 INFO L225 Difference]: With dead ends: 84928 [2025-03-03 10:43:33,826 INFO L226 Difference]: Without dead ends: 42854 [2025-03-03 10:43:33,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:43:33,852 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1074 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:33,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 798 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:43:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42854 states. [2025-03-03 10:43:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42854 to 42853. [2025-03-03 10:43:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42853 states, 42852 states have (on average 1.0797162326145804) internal successors, (46268), 42852 states have internal predecessors, (46268), 0 states have call successors, (0), 0 states 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:43:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42853 states to 42853 states and 46268 transitions. [2025-03-03 10:43:34,170 INFO L78 Accepts]: Start accepts. Automaton has 42853 states and 46268 transitions. Word has length 344 [2025-03-03 10:43:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:34,170 INFO L471 AbstractCegarLoop]: Abstraction has 42853 states and 46268 transitions. [2025-03-03 10:43:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:43:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 42853 states and 46268 transitions. [2025-03-03 10:43:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-03 10:43:34,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:34,175 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:34,181 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:43:34,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 10:43:34,379 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:34,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:34,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2031314307, now seen corresponding path program 1 times [2025-03-03 10:43:34,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:34,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804577206] [2025-03-03 10:43:34,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:34,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:34,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-03 10:43:34,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-03 10:43:34,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:34,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 10:43:34,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:34,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804577206] [2025-03-03 10:43:34,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804577206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:34,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:34,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:43:34,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139128852] [2025-03-03 10:43:34,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:34,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:43:34,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:34,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:43:34,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:43:34,587 INFO L87 Difference]: Start difference. First operand 42853 states and 46268 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:43:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:39,414 INFO L93 Difference]: Finished difference Result 147303 states and 159298 transitions. [2025-03-03 10:43:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:43:39,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 386 [2025-03-03 10:43:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:39,527 INFO L225 Difference]: With dead ends: 147303 [2025-03-03 10:43:39,527 INFO L226 Difference]: Without dead ends: 105239 [2025-03-03 10:43:39,573 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:43:39,574 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 1712 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 5977 mSolverCounterSat, 1088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 7065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1088 IncrementalHoareTripleChecker+Valid, 5977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:39,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 738 Invalid, 7065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1088 Valid, 5977 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 10:43:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105239 states. [2025-03-03 10:43:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105239 to 102743. [2025-03-03 10:43:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102743 states, 102742 states have (on average 1.072424130345915) internal successors, (110183), 102742 states have internal predecessors, (110183), 0 states have call successors, (0), 0 states 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:43:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102743 states to 102743 states and 110183 transitions. [2025-03-03 10:43:40,545 INFO L78 Accepts]: Start accepts. Automaton has 102743 states and 110183 transitions. Word has length 386 [2025-03-03 10:43:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:40,545 INFO L471 AbstractCegarLoop]: Abstraction has 102743 states and 110183 transitions. [2025-03-03 10:43:40,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:43:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 102743 states and 110183 transitions. [2025-03-03 10:43:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-03 10:43:40,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:40,559 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, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:40,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:43:40,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:40,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1232382312, now seen corresponding path program 1 times [2025-03-03 10:43:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:40,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383343922] [2025-03-03 10:43:40,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:40,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:40,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-03 10:43:40,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-03 10:43:40,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:40,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 369 proven. 113 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 10:43:41,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:41,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383343922] [2025-03-03 10:43:41,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383343922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:43:41,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811057632] [2025-03-03 10:43:41,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:41,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:41,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:41,392 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:43:41,394 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:43:41,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-03 10:43:41,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-03 10:43:41,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:41,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:41,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:43:41,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:43:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2025-03-03 10:43:41,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:43:41,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811057632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:41,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:43:41,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:43:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733936353] [2025-03-03 10:43:41,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:41,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:41,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:41,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:43:41,631 INFO L87 Difference]: Start difference. First operand 102743 states and 110183 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:44,385 INFO L93 Difference]: Finished difference Result 206272 states and 221159 transitions. [2025-03-03 10:43:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:44,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 429 [2025-03-03 10:43:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:44,513 INFO L225 Difference]: With dead ends: 206272 [2025-03-03 10:43:44,513 INFO L226 Difference]: Without dead ends: 104318 [2025-03-03 10:43:44,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:43:44,576 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 1001 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 3082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:44,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1467 Invalid, 3082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:43:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104318 states. [2025-03-03 10:43:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104318 to 102730. [2025-03-03 10:43:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102730 states, 102729 states have (on average 1.0600998744268901) internal successors, (108903), 102729 states have internal predecessors, (108903), 0 states have call successors, (0), 0 states 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:43:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102730 states to 102730 states and 108903 transitions. [2025-03-03 10:43:45,708 INFO L78 Accepts]: Start accepts. Automaton has 102730 states and 108903 transitions. Word has length 429 [2025-03-03 10:43:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:45,708 INFO L471 AbstractCegarLoop]: Abstraction has 102730 states and 108903 transitions. [2025-03-03 10:43:45,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 102730 states and 108903 transitions. [2025-03-03 10:43:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-03 10:43:45,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:45,714 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:45,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:43:45,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:45,915 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 98106263, now seen corresponding path program 1 times [2025-03-03 10:43:45,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:45,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369956602] [2025-03-03 10:43:45,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:45,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-03 10:43:45,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-03 10:43:45,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:45,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 408 proven. 110 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-03 10:43:46,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369956602] [2025-03-03 10:43:46,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369956602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:43:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915181620] [2025-03-03 10:43:46,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:46,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:46,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:46,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:43:46,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:43:46,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-03 10:43:46,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-03 10:43:46,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:46,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:46,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:43:46,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:43:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 10:43:46,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:43:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915181620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:46,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:43:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:43:46,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203511722] [2025-03-03 10:43:46,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:46,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:46,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:46,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:43:46,807 INFO L87 Difference]: Start difference. First operand 102730 states and 108903 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:43:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:49,449 INFO L93 Difference]: Finished difference Result 229867 states and 244829 transitions. [2025-03-03 10:43:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:49,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 447 [2025-03-03 10:43:49,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:49,600 INFO L225 Difference]: With dead ends: 229867 [2025-03-03 10:43:49,600 INFO L226 Difference]: Without dead ends: 127926 [2025-03-03 10:43:49,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:43:49,673 INFO L435 NwaCegarLoop]: 1625 mSDtfsCounter, 859 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:49,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1745 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:43:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127926 states. [2025-03-03 10:43:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127926 to 125552. [2025-03-03 10:43:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125552 states, 125551 states have (on average 1.0629863561421256) internal successors, (133459), 125551 states have internal predecessors, (133459), 0 states have call successors, (0), 0 states 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:43:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125552 states to 125552 states and 133459 transitions. [2025-03-03 10:43:50,953 INFO L78 Accepts]: Start accepts. Automaton has 125552 states and 133459 transitions. Word has length 447 [2025-03-03 10:43:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:50,954 INFO L471 AbstractCegarLoop]: Abstraction has 125552 states and 133459 transitions. [2025-03-03 10:43:50,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:43:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 125552 states and 133459 transitions. [2025-03-03 10:43:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-03 10:43:50,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:50,962 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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:43:50,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:43:51,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:51,163 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:51,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1348200039, now seen corresponding path program 1 times [2025-03-03 10:43:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:51,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931701571] [2025-03-03 10:43:51,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:51,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-03 10:43:51,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-03 10:43:51,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:51,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 475 proven. 113 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-03 10:43:52,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:52,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931701571] [2025-03-03 10:43:52,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931701571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:43:52,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412786230] [2025-03-03 10:43:52,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:52,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:52,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:52,258 INFO L229 MonitoredProcess]: Starting monitored process 6 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:43:52,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:43:52,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-03 10:43:52,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-03 10:43:52,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:52,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:52,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:43:52,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:43:52,509 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2025-03-03 10:43:52,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:43:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412786230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:52,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:43:52,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:43:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398663827] [2025-03-03 10:43:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:52,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:52,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:52,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:43:52,511 INFO L87 Difference]: Start difference. First operand 125552 states and 133459 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:43:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:55,472 INFO L93 Difference]: Finished difference Result 251872 states and 268080 transitions. [2025-03-03 10:43:55,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:55,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 482 [2025-03-03 10:43:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:55,610 INFO L225 Difference]: With dead ends: 251872 [2025-03-03 10:43:55,611 INFO L226 Difference]: Without dead ends: 142072 [2025-03-03 10:43:55,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:43:55,638 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 804 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:55,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1825 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:43:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142072 states. [2025-03-03 10:43:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142072 to 133413. [2025-03-03 10:43:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133413 states, 133412 states have (on average 1.0600095943393397) internal successors, (141418), 133412 states have internal predecessors, (141418), 0 states have call successors, (0), 0 states 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:43:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133413 states to 133413 states and 141418 transitions. [2025-03-03 10:43:56,727 INFO L78 Accepts]: Start accepts. Automaton has 133413 states and 141418 transitions. Word has length 482 [2025-03-03 10:43:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:56,728 INFO L471 AbstractCegarLoop]: Abstraction has 133413 states and 141418 transitions. [2025-03-03 10:43:56,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:43:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 133413 states and 141418 transitions. [2025-03-03 10:43:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-03 10:43:56,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:56,736 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:56,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:43:56,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:43:56,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:56,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash 154212217, now seen corresponding path program 1 times [2025-03-03 10:43:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106387816] [2025-03-03 10:43:56,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:56,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-03 10:43:56,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-03 10:43:56,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:56,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 473 proven. 113 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 10:43:57,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:57,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106387816] [2025-03-03 10:43:57,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106387816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:43:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950090190] [2025-03-03 10:43:57,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:57,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:57,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:57,905 INFO L229 MonitoredProcess]: Starting monitored process 7 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:43:57,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:43:57,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-03 10:43:58,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-03 10:43:58,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:58,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:58,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:43:58,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:43:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 10:43:58,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:43:58,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950090190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:58,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:43:58,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:43:58,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428073017] [2025-03-03 10:43:58,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:58,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:58,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:58,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:43:58,116 INFO L87 Difference]: Start difference. First operand 133413 states and 141418 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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:44:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:00,615 INFO L93 Difference]: Finished difference Result 264464 states and 280346 transitions. [2025-03-03 10:44:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2025-03-03 10:44:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:00,771 INFO L225 Difference]: With dead ends: 264464 [2025-03-03 10:44:00,771 INFO L226 Difference]: Without dead ends: 135776 [2025-03-03 10:44:00,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:44:00,822 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 978 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:00,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 483 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:44:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135776 states. [2025-03-03 10:44:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135776 to 133398. [2025-03-03 10:44:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133398 states, 133397 states have (on average 1.0510656161682796) internal successors, (140209), 133397 states have internal predecessors, (140209), 0 states have call successors, (0), 0 states 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:44:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133398 states to 133398 states and 140209 transitions. [2025-03-03 10:44:02,239 INFO L78 Accepts]: Start accepts. Automaton has 133398 states and 140209 transitions. Word has length 484 [2025-03-03 10:44:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 133398 states and 140209 transitions. [2025-03-03 10:44:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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:44:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 133398 states and 140209 transitions. [2025-03-03 10:44:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-03 10:44:02,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:02,249 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:02,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:44:02,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:44:02,450 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:02,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash -789568096, now seen corresponding path program 1 times [2025-03-03 10:44:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732122653] [2025-03-03 10:44:02,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:02,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-03 10:44:02,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-03 10:44:02,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:02,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-03 10:44:03,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:03,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732122653] [2025-03-03 10:44:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732122653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:03,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:03,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560080370] [2025-03-03 10:44:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:03,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:03,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:03,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:03,054 INFO L87 Difference]: Start difference. First operand 133398 states and 140209 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:05,530 INFO L93 Difference]: Finished difference Result 260469 states and 274491 transitions. [2025-03-03 10:44:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:05,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 505 [2025-03-03 10:44:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:05,693 INFO L225 Difference]: With dead ends: 260469 [2025-03-03 10:44:05,693 INFO L226 Difference]: Without dead ends: 142819 [2025-03-03 10:44:05,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:05,765 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1175 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 3039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:05,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 344 Invalid, 3039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [782 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:44:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142819 states. [2025-03-03 10:44:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142819 to 142032. [2025-03-03 10:44:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142032 states, 142031 states have (on average 1.0489681830023023) internal successors, (148986), 142031 states have internal predecessors, (148986), 0 states have call successors, (0), 0 states 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:44:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142032 states to 142032 states and 148986 transitions. [2025-03-03 10:44:07,625 INFO L78 Accepts]: Start accepts. Automaton has 142032 states and 148986 transitions. Word has length 505 [2025-03-03 10:44:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:07,626 INFO L471 AbstractCegarLoop]: Abstraction has 142032 states and 148986 transitions. [2025-03-03 10:44:07,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 142032 states and 148986 transitions. [2025-03-03 10:44:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-03-03 10:44:07,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:07,642 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, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:07,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:44:07,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1987333035, now seen corresponding path program 1 times [2025-03-03 10:44:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:07,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462298147] [2025-03-03 10:44:07,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:07,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-03 10:44:07,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-03 10:44:07,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:07,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2025-03-03 10:44:07,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:07,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462298147] [2025-03-03 10:44:07,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462298147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:07,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:07,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:07,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790740091] [2025-03-03 10:44:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:07,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:07,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:07,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:07,962 INFO L87 Difference]: Start difference. First operand 142032 states and 148986 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:44:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:10,614 INFO L93 Difference]: Finished difference Result 269109 states and 282671 transitions. [2025-03-03 10:44:10,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:10,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 546 [2025-03-03 10:44:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:10,755 INFO L225 Difference]: With dead ends: 269109 [2025-03-03 10:44:10,755 INFO L226 Difference]: Without dead ends: 142825 [2025-03-03 10:44:10,787 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:44:10,787 INFO L435 NwaCegarLoop]: 1746 mSDtfsCounter, 722 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:10,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1872 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2490 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:44:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142825 states. [2025-03-03 10:44:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142825 to 142820. [2025-03-03 10:44:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142820 states, 142819 states have (on average 1.0489780771465982) internal successors, (149814), 142819 states have internal predecessors, (149814), 0 states have call successors, (0), 0 states 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:44:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142820 states to 142820 states and 149814 transitions. [2025-03-03 10:44:12,231 INFO L78 Accepts]: Start accepts. Automaton has 142820 states and 149814 transitions. Word has length 546 [2025-03-03 10:44:12,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:12,231 INFO L471 AbstractCegarLoop]: Abstraction has 142820 states and 149814 transitions. [2025-03-03 10:44:12,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:44:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 142820 states and 149814 transitions. [2025-03-03 10:44:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-03-03 10:44:12,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:12,249 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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:44:12,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:44:12,249 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:12,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1780471522, now seen corresponding path program 1 times [2025-03-03 10:44:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:12,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144979749] [2025-03-03 10:44:12,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:12,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-03-03 10:44:12,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-03-03 10:44:12,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:12,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2025-03-03 10:44:12,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:12,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144979749] [2025-03-03 10:44:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144979749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:12,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:12,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:12,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309433153] [2025-03-03 10:44:12,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:12,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:44:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:12,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:44:12,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:12,975 INFO L87 Difference]: Start difference. First operand 142820 states and 149814 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)