./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label27.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 dc961fc62f24960fbef105f97d1eee66be6194c126d8d078cb5da412dc4c48ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:09:24,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:09:24,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:09:24,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:09:24,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:09:24,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:09:24,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:09:24,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:09:24,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:09:24,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:09:24,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:09:24,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:09:24,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:09:24,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:09:24,140 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:09:24,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:09:24,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:09:24,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:09:24,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:09:24,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:09:24,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:09:24,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:09:24,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:09:24,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:09:24,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:09:24,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:09:24,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:09:24,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:09:24,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:09:24,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:09:24,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:09:24,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:09:24,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:09:24,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:09:24,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:09:24,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:09:24,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:09:24,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:09:24,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:09:24,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:09:24,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:09:24,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:09:24,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:09:24,145 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 -> dc961fc62f24960fbef105f97d1eee66be6194c126d8d078cb5da412dc4c48ac [2025-03-16 15:09:24,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:09:24,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:09:24,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:09:24,382 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:09:24,382 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:09:24,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label27.c [2025-03-16 15:09:25,471 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8368442/9dafe5d3ed5247aba6a34ae2f1c755dd/FLAG440feaf1f [2025-03-16 15:09:25,841 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:09:25,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label27.c [2025-03-16 15:09:25,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8368442/9dafe5d3ed5247aba6a34ae2f1c755dd/FLAG440feaf1f [2025-03-16 15:09:26,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8368442/9dafe5d3ed5247aba6a34ae2f1c755dd [2025-03-16 15:09:26,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:09:26,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:09:26,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:09:26,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:09:26,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:09:26,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e61abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26, skipping insertion in model container [2025-03-16 15:09:26,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:09:26,212 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/Problem15_label27.c[4605,4618] [2025-03-16 15:09:26,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:09:26,492 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:09:26,509 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/Problem15_label27.c[4605,4618] [2025-03-16 15:09:26,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:09:26,652 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:09:26,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26 WrapperNode [2025-03-16 15:09:26,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:09:26,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:09:26,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:09:26,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:09:26,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,808 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-16 15:09:26,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:09:26,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:09:26,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:09:26,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:09:26,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,921 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:09:26,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:26,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:27,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:27,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:09:27,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:09:27,046 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:09:27,046 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:09:27,048 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (1/1) ... [2025-03-16 15:09:27,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:09:27,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:27,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:09:27,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:09:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:09:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:09:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:09:27,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:09:27,135 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:09:27,136 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:09:28,953 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-16 15:09:29,017 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-16 15:09:29,017 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:09:29,032 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:09:29,036 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:09:29,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:09:29 BoogieIcfgContainer [2025-03-16 15:09:29,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:09:29,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:09:29,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:09:29,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:09:29,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:09:26" (1/3) ... [2025-03-16 15:09:29,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4fbc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:09:29, skipping insertion in model container [2025-03-16 15:09:29,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:26" (2/3) ... [2025-03-16 15:09:29,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4fbc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:09:29, skipping insertion in model container [2025-03-16 15:09:29,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:09:29" (3/3) ... [2025-03-16 15:09:29,044 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label27.c [2025-03-16 15:09:29,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:09:29,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label27.c that has 1 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:09:29,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:09:29,114 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;@16761ecd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:09:29,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:09:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 15:09:29,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:29,123 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] [2025-03-16 15:09:29,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:29,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1061841270, now seen corresponding path program 1 times [2025-03-16 15:09:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353135749] [2025-03-16 15:09:29,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:29,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 15:09:29,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 15:09:29,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:29,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:29,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353135749] [2025-03-16 15:09:29,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353135749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:29,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:29,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221983034] [2025-03-16 15:09:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:09:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:29,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:09:29,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:09:29,268 INFO L87 Difference]: Start difference. First operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:29,305 INFO L93 Difference]: Finished difference Result 725 states and 1375 transitions. [2025-03-16 15:09:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:09:29,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 15:09:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:29,313 INFO L225 Difference]: With dead ends: 725 [2025-03-16 15:09:29,313 INFO L226 Difference]: Without dead ends: 360 [2025-03-16 15:09:29,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:09:29,317 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:29,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:09:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-16 15:09:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-16 15:09:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2025-03-16 15:09:29,348 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 36 [2025-03-16 15:09:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:29,348 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2025-03-16 15:09:29,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2025-03-16 15:09:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 15:09:29,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:29,349 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] [2025-03-16 15:09:29,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:09:29,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:29,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash -946507813, now seen corresponding path program 1 times [2025-03-16 15:09:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:29,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504238444] [2025-03-16 15:09:29,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:29,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:29,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 15:09:29,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 15:09:29,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:29,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:29,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:29,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504238444] [2025-03-16 15:09:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504238444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:29,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:29,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717858446] [2025-03-16 15:09:29,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:29,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:29,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:29,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:29,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:29,502 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:30,785 INFO L93 Difference]: Finished difference Result 1023 states and 1787 transitions. [2025-03-16 15:09:30,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:30,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 15:09:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:30,789 INFO L225 Difference]: With dead ends: 1023 [2025-03-16 15:09:30,789 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 15:09:30,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:30,790 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 280 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:30,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 319 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:09:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 15:09:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2025-03-16 15:09:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2025-03-16 15:09:30,817 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 36 [2025-03-16 15:09:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:30,817 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2025-03-16 15:09:30,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2025-03-16 15:09:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 15:09:30,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:30,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:30,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:09:30,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:30,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1361132039, now seen corresponding path program 1 times [2025-03-16 15:09:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983718260] [2025-03-16 15:09:30,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:30,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 15:09:30,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 15:09:30,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:30,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983718260] [2025-03-16 15:09:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983718260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:31,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745449162] [2025-03-16 15:09:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:31,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:31,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:31,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:31,142 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:32,095 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2025-03-16 15:09:32,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:32,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-16 15:09:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:32,099 INFO L225 Difference]: With dead ends: 1623 [2025-03-16 15:09:32,099 INFO L226 Difference]: Without dead ends: 962 [2025-03-16 15:09:32,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:32,100 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:32,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 336 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:09:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-16 15:09:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2025-03-16 15:09:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2025-03-16 15:09:32,119 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 101 [2025-03-16 15:09:32,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:32,120 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2025-03-16 15:09:32,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2025-03-16 15:09:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 15:09:32,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:32,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:32,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:09:32,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:32,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1508869726, now seen corresponding path program 1 times [2025-03-16 15:09:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:32,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081158648] [2025-03-16 15:09:32,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:32,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 15:09:32,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 15:09:32,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:32,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081158648] [2025-03-16 15:09:32,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081158648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:32,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:32,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:09:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416146743] [2025-03-16 15:09:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:09:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:32,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:09:32,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:09:32,338 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:33,868 INFO L93 Difference]: Finished difference Result 2239 states and 3196 transitions. [2025-03-16 15:09:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:09:33,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 15:09:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:33,874 INFO L225 Difference]: With dead ends: 2239 [2025-03-16 15:09:33,874 INFO L226 Difference]: Without dead ends: 1577 [2025-03-16 15:09:33,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:09:33,878 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 356 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:33,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 368 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:09:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-03-16 15:09:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1265. [2025-03-16 15:09:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3045886075949367) internal successors, (1649), 1264 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1649 transitions. [2025-03-16 15:09:33,905 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1649 transitions. Word has length 106 [2025-03-16 15:09:33,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:33,906 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1649 transitions. [2025-03-16 15:09:33,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1649 transitions. [2025-03-16 15:09:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 15:09:33,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:33,908 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:09:33,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:09:33,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:33,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:33,909 INFO L85 PathProgramCache]: Analyzing trace with hash -606038386, now seen corresponding path program 1 times [2025-03-16 15:09:33,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:33,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486965569] [2025-03-16 15:09:33,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:33,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 15:09:33,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 15:09:33,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:33,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:34,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:34,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486965569] [2025-03-16 15:09:34,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486965569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:34,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:34,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:34,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102461817] [2025-03-16 15:09:34,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:34,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:09:34,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:34,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:09:34,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:09:34,142 INFO L87 Difference]: Start difference. First operand 1265 states and 1649 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:35,984 INFO L93 Difference]: Finished difference Result 4669 states and 6169 transitions. [2025-03-16 15:09:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:09:35,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-03-16 15:09:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:35,992 INFO L225 Difference]: With dead ends: 4669 [2025-03-16 15:09:35,993 INFO L226 Difference]: Without dead ends: 3405 [2025-03-16 15:09:35,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:09:35,994 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 490 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:35,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 344 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:09:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2025-03-16 15:09:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3380. [2025-03-16 15:09:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.2370523823616455) internal successors, (4180), 3379 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4180 transitions. [2025-03-16 15:09:36,036 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4180 transitions. Word has length 202 [2025-03-16 15:09:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:36,037 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4180 transitions. [2025-03-16 15:09:36,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4180 transitions. [2025-03-16 15:09:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 15:09:36,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:36,039 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:09:36,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:09:36,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:36,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1748693160, now seen corresponding path program 1 times [2025-03-16 15:09:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:36,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692447934] [2025-03-16 15:09:36,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:36,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 15:09:36,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 15:09:36,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:36,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:09:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692447934] [2025-03-16 15:09:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692447934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483140472] [2025-03-16 15:09:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:36,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:36,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:36,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:36,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:36,186 INFO L87 Difference]: Start difference. First operand 3380 states and 4180 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-16 15:09:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:37,242 INFO L93 Difference]: Finished difference Result 8562 states and 10755 transitions. [2025-03-16 15:09:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:37,243 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 206 [2025-03-16 15:09:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:37,257 INFO L225 Difference]: With dead ends: 8562 [2025-03-16 15:09:37,258 INFO L226 Difference]: Without dead ends: 5482 [2025-03-16 15:09:37,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:37,263 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:37,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:09:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2025-03-16 15:09:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5477. [2025-03-16 15:09:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1689189189189189) internal successors, (6401), 5476 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6401 transitions. [2025-03-16 15:09:37,373 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6401 transitions. Word has length 206 [2025-03-16 15:09:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:37,374 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6401 transitions. [2025-03-16 15:09:37,374 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-16 15:09:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6401 transitions. [2025-03-16 15:09:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-16 15:09:37,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:37,378 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:37,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:09:37,378 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:37,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:37,379 INFO L85 PathProgramCache]: Analyzing trace with hash 560929532, now seen corresponding path program 1 times [2025-03-16 15:09:37,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:37,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893164622] [2025-03-16 15:09:37,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:37,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:37,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-16 15:09:37,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-16 15:09:37,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:37,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 15:09:37,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:37,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893164622] [2025-03-16 15:09:37,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893164622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:37,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:37,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011438548] [2025-03-16 15:09:37,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:37,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:37,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:37,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:37,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:37,796 INFO L87 Difference]: Start difference. First operand 5477 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:38,695 INFO L93 Difference]: Finished difference Result 10654 states and 12490 transitions. [2025-03-16 15:09:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:38,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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 308 [2025-03-16 15:09:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:38,708 INFO L225 Difference]: With dead ends: 10654 [2025-03-16 15:09:38,708 INFO L226 Difference]: Without dead ends: 5477 [2025-03-16 15:09:38,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:38,714 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:38,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 358 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:09:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2025-03-16 15:09:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2025-03-16 15:09:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1678232286340395) internal successors, (6395), 5476 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6395 transitions. [2025-03-16 15:09:38,780 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6395 transitions. Word has length 308 [2025-03-16 15:09:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:38,781 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6395 transitions. [2025-03-16 15:09:38,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6395 transitions. [2025-03-16 15:09:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 15:09:38,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:38,785 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:38,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:09:38,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:38,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash 822525517, now seen corresponding path program 1 times [2025-03-16 15:09:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:38,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411914568] [2025-03-16 15:09:38,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:38,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 15:09:38,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 15:09:38,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:38,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:09:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:38,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411914568] [2025-03-16 15:09:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411914568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:38,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961925996] [2025-03-16 15:09:38,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:38,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:38,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:38,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:38,952 INFO L87 Difference]: Start difference. First operand 5477 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:40,105 INFO L93 Difference]: Finished difference Result 11850 states and 14152 transitions. [2025-03-16 15:09:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:40,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 323 [2025-03-16 15:09:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:40,119 INFO L225 Difference]: With dead ends: 11850 [2025-03-16 15:09:40,120 INFO L226 Difference]: Without dead ends: 6673 [2025-03-16 15:09:40,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:40,125 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 277 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:40,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:09:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2025-03-16 15:09:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 5174. [2025-03-16 15:09:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5174 states, 5173 states have (on average 1.174946839358206) internal successors, (6078), 5173 states have internal predecessors, (6078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5174 states to 5174 states and 6078 transitions. [2025-03-16 15:09:40,195 INFO L78 Accepts]: Start accepts. Automaton has 5174 states and 6078 transitions. Word has length 323 [2025-03-16 15:09:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:40,195 INFO L471 AbstractCegarLoop]: Abstraction has 5174 states and 6078 transitions. [2025-03-16 15:09:40,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5174 states and 6078 transitions. [2025-03-16 15:09:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-16 15:09:40,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:40,201 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:09:40,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:40,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1613737192, now seen corresponding path program 1 times [2025-03-16 15:09:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:40,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025765268] [2025-03-16 15:09:40,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:40,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-16 15:09:40,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-16 15:09:40,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:40,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 15:09:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025765268] [2025-03-16 15:09:40,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025765268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:40,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:40,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:40,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115648968] [2025-03-16 15:09:40,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:40,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:40,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:40,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:40,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:40,416 INFO L87 Difference]: Start difference. First operand 5174 states and 6078 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:41,668 INFO L93 Difference]: Finished difference Result 12150 states and 14568 transitions. [2025-03-16 15:09:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 382 [2025-03-16 15:09:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:41,682 INFO L225 Difference]: With dead ends: 12150 [2025-03-16 15:09:41,682 INFO L226 Difference]: Without dead ends: 7276 [2025-03-16 15:09:41,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:41,687 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 291 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:41,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 634 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:09:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7276 states. [2025-03-16 15:09:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7276 to 6379. [2025-03-16 15:09:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6379 states, 6378 states have (on average 1.1560050172467857) internal successors, (7373), 6378 states have internal predecessors, (7373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 7373 transitions. [2025-03-16 15:09:41,767 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 7373 transitions. Word has length 382 [2025-03-16 15:09:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:41,767 INFO L471 AbstractCegarLoop]: Abstraction has 6379 states and 7373 transitions. [2025-03-16 15:09:41,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 7373 transitions. [2025-03-16 15:09:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-16 15:09:41,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:41,772 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:41,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:09:41,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 546300386, now seen corresponding path program 1 times [2025-03-16 15:09:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845785493] [2025-03-16 15:09:41,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:41,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-16 15:09:41,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-16 15:09:41,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:41,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:42,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:42,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845785493] [2025-03-16 15:09:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845785493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:42,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:42,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:42,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798683799] [2025-03-16 15:09:42,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:42,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:42,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:42,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:42,014 INFO L87 Difference]: Start difference. First operand 6379 states and 7373 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:43,071 INFO L93 Difference]: Finished difference Result 14562 states and 17154 transitions. [2025-03-16 15:09:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:43,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 388 [2025-03-16 15:09:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:43,085 INFO L225 Difference]: With dead ends: 14562 [2025-03-16 15:09:43,085 INFO L226 Difference]: Without dead ends: 8483 [2025-03-16 15:09:43,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:43,091 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:43,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 602 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:09:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8483 states. [2025-03-16 15:09:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8483 to 7583. [2025-03-16 15:09:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7583 states, 7582 states have (on average 1.1427064099182274) internal successors, (8664), 7582 states have internal predecessors, (8664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7583 states to 7583 states and 8664 transitions. [2025-03-16 15:09:43,158 INFO L78 Accepts]: Start accepts. Automaton has 7583 states and 8664 transitions. Word has length 388 [2025-03-16 15:09:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:43,159 INFO L471 AbstractCegarLoop]: Abstraction has 7583 states and 8664 transitions. [2025-03-16 15:09:43,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 7583 states and 8664 transitions. [2025-03-16 15:09:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-16 15:09:43,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:43,163 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:43,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:09:43,164 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:43,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash 840407197, now seen corresponding path program 1 times [2025-03-16 15:09:43,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:43,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747320980] [2025-03-16 15:09:43,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:43,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:43,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-16 15:09:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-16 15:09:43,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:43,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:09:43,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747320980] [2025-03-16 15:09:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747320980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:43,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685053336] [2025-03-16 15:09:43,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:43,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:43,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:43,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:43,359 INFO L87 Difference]: Start difference. First operand 7583 states and 8664 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:44,443 INFO L93 Difference]: Finished difference Result 16660 states and 19399 transitions. [2025-03-16 15:09:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:44,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 405 [2025-03-16 15:09:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:44,456 INFO L225 Difference]: With dead ends: 16660 [2025-03-16 15:09:44,457 INFO L226 Difference]: Without dead ends: 9377 [2025-03-16 15:09:44,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:44,463 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:44,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 615 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:09:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2025-03-16 15:09:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 9373. [2025-03-16 15:09:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9373 states, 9372 states have (on average 1.130281690140845) internal successors, (10593), 9372 states have internal predecessors, (10593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9373 states to 9373 states and 10593 transitions. [2025-03-16 15:09:44,535 INFO L78 Accepts]: Start accepts. Automaton has 9373 states and 10593 transitions. Word has length 405 [2025-03-16 15:09:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:44,537 INFO L471 AbstractCegarLoop]: Abstraction has 9373 states and 10593 transitions. [2025-03-16 15:09:44,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 9373 states and 10593 transitions. [2025-03-16 15:09:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-16 15:09:44,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:44,541 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:44,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:09:44,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1669603894, now seen corresponding path program 1 times [2025-03-16 15:09:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:44,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039795825] [2025-03-16 15:09:44,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:44,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:44,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 15:09:44,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 15:09:44,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:44,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 35 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039795825] [2025-03-16 15:09:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039795825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555296864] [2025-03-16 15:09:44,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:44,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:44,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:44,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:09:44,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:09:44,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 15:09:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 15:09:45,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:45,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:45,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:09:45,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:09:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:09:45,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:09:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555296864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:09:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:09:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325703871] [2025-03-16 15:09:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:45,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:45,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:45,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:09:45,196 INFO L87 Difference]: Start difference. First operand 9373 states and 10593 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:46,451 INFO L93 Difference]: Finished difference Result 21503 states and 24724 transitions. [2025-03-16 15:09:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:46,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 413 [2025-03-16 15:09:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:46,470 INFO L225 Difference]: With dead ends: 21503 [2025-03-16 15:09:46,470 INFO L226 Difference]: Without dead ends: 12430 [2025-03-16 15:09:46,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:09:46,479 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 378 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:46,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 634 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:09:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12430 states. [2025-03-16 15:09:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12430 to 12424. [2025-03-16 15:09:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12424 states, 12423 states have (on average 1.1454560090155357) internal successors, (14230), 12423 states have internal predecessors, (14230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12424 states to 12424 states and 14230 transitions. [2025-03-16 15:09:46,647 INFO L78 Accepts]: Start accepts. Automaton has 12424 states and 14230 transitions. Word has length 413 [2025-03-16 15:09:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:46,647 INFO L471 AbstractCegarLoop]: Abstraction has 12424 states and 14230 transitions. [2025-03-16 15:09:46,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 12424 states and 14230 transitions. [2025-03-16 15:09:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-16 15:09:46,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:46,653 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:46,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:09:46,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 15:09:46,858 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:46,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2128627902, now seen corresponding path program 1 times [2025-03-16 15:09:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048165282] [2025-03-16 15:09:46,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:46,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-16 15:09:46,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-16 15:09:46,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:46,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:09:47,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:47,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048165282] [2025-03-16 15:09:47,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048165282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:47,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:47,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:47,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171944312] [2025-03-16 15:09:47,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:47,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:47,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:47,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:47,157 INFO L87 Difference]: Start difference. First operand 12424 states and 14230 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:48,321 INFO L93 Difference]: Finished difference Result 32321 states and 37116 transitions. [2025-03-16 15:09:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:48,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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 485 [2025-03-16 15:09:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:48,350 INFO L225 Difference]: With dead ends: 32321 [2025-03-16 15:09:48,350 INFO L226 Difference]: Without dead ends: 20197 [2025-03-16 15:09:48,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:48,360 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 307 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:48,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 171 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:09:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20197 states. [2025-03-16 15:09:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20197 to 17207. [2025-03-16 15:09:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17207 states, 17206 states have (on average 1.144426362896664) internal successors, (19691), 17206 states have internal predecessors, (19691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17207 states to 17207 states and 19691 transitions. [2025-03-16 15:09:48,519 INFO L78 Accepts]: Start accepts. Automaton has 17207 states and 19691 transitions. Word has length 485 [2025-03-16 15:09:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:48,520 INFO L471 AbstractCegarLoop]: Abstraction has 17207 states and 19691 transitions. [2025-03-16 15:09:48,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 17207 states and 19691 transitions. [2025-03-16 15:09:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-16 15:09:48,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:48,524 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-16 15:09:48,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:09:48,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:48,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash -317456117, now seen corresponding path program 1 times [2025-03-16 15:09:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:48,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266321425] [2025-03-16 15:09:48,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:48,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-16 15:09:48,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-16 15:09:48,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:48,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 479 proven. 39 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-16 15:09:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266321425] [2025-03-16 15:09:48,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266321425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981043947] [2025-03-16 15:09:48,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:48,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:48,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:48,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:09:48,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:09:48,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-16 15:09:49,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-16 15:09:49,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:49,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:49,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:09:49,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:09:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 15:09:49,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:09:49,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981043947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:49,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:09:49,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:09:49,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155157026] [2025-03-16 15:09:49,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:49,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:49,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:49,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:49,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:09:49,114 INFO L87 Difference]: Start difference. First operand 17207 states and 19691 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:50,039 INFO L93 Difference]: Finished difference Result 37103 states and 42705 transitions. [2025-03-16 15:09:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:50,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 520 [2025-03-16 15:09:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:50,067 INFO L225 Difference]: With dead ends: 37103 [2025-03-16 15:09:50,067 INFO L226 Difference]: Without dead ends: 20196 [2025-03-16 15:09:50,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:09:50,083 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 380 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:50,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 443 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:09:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20196 states. [2025-03-16 15:09:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20196 to 15052. [2025-03-16 15:09:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15052 states, 15051 states have (on average 1.1298917015480698) internal successors, (17006), 15051 states have internal predecessors, (17006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15052 states to 15052 states and 17006 transitions. [2025-03-16 15:09:50,227 INFO L78 Accepts]: Start accepts. Automaton has 15052 states and 17006 transitions. Word has length 520 [2025-03-16 15:09:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:50,228 INFO L471 AbstractCegarLoop]: Abstraction has 15052 states and 17006 transitions. [2025-03-16 15:09:50,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15052 states and 17006 transitions. [2025-03-16 15:09:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-03-16 15:09:50,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:50,232 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-16 15:09:50,238 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-16 15:09:50,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 15:09:50,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:50,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1273695403, now seen corresponding path program 1 times [2025-03-16 15:09:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905531115] [2025-03-16 15:09:50,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:50,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-16 15:09:50,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-16 15:09:50,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:50,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-16 15:09:50,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905531115] [2025-03-16 15:09:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905531115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:50,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571848718] [2025-03-16 15:09:50,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:50,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:50,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:50,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:50,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:50,730 INFO L87 Difference]: Start difference. First operand 15052 states and 17006 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:51,814 INFO L93 Difference]: Finished difference Result 35798 states and 40819 transitions. [2025-03-16 15:09:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:51,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 524 [2025-03-16 15:09:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:51,838 INFO L225 Difference]: With dead ends: 35798 [2025-03-16 15:09:51,838 INFO L226 Difference]: Without dead ends: 21046 [2025-03-16 15:09:51,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:51,850 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:51,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 619 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:09:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21046 states. [2025-03-16 15:09:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21046 to 20138. [2025-03-16 15:09:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20138 states, 20137 states have (on average 1.1227094403337141) internal successors, (22608), 20137 states have internal predecessors, (22608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20138 states to 20138 states and 22608 transitions. [2025-03-16 15:09:52,087 INFO L78 Accepts]: Start accepts. Automaton has 20138 states and 22608 transitions. Word has length 524 [2025-03-16 15:09:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:52,087 INFO L471 AbstractCegarLoop]: Abstraction has 20138 states and 22608 transitions. [2025-03-16 15:09:52,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 20138 states and 22608 transitions. [2025-03-16 15:09:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-16 15:09:52,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:52,096 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:52,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:09:52,096 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:52,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash -133854588, now seen corresponding path program 1 times [2025-03-16 15:09:52,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034587150] [2025-03-16 15:09:52,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:52,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:52,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-16 15:09:52,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-16 15:09:52,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:52,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 556 proven. 39 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-16 15:09:52,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:52,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034587150] [2025-03-16 15:09:52,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034587150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:52,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767349724] [2025-03-16 15:09:52,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:52,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:52,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:52,555 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-16 15:09:52,557 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-16 15:09:52,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-16 15:09:52,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-16 15:09:52,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:52,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:09:52,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:09:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 556 proven. 39 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-16 15:09:53,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:09:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 556 proven. 39 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-16 15:09:53,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767349724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:09:53,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:09:53,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-16 15:09:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609672502] [2025-03-16 15:09:53,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:09:53,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:09:53,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:53,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:09:53,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:09:53,742 INFO L87 Difference]: Start difference. First operand 20138 states and 22608 transitions. Second operand has 9 states, 9 states have (on average 82.22222222222223) internal successors, (740), 8 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:57,121 INFO L93 Difference]: Finished difference Result 48307 states and 53929 transitions. [2025-03-16 15:09:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 15:09:57,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.22222222222223) internal successors, (740), 8 states have internal predecessors, (740), 0 states have call successors, (0), 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 579 [2025-03-16 15:09:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:57,143 INFO L225 Difference]: With dead ends: 48307 [2025-03-16 15:09:57,143 INFO L226 Difference]: Without dead ends: 22229 [2025-03-16 15:09:57,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1167 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-16 15:09:57,157 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 3061 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4727 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3061 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 5401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 4727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:57,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3061 Valid, 194 Invalid, 5401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 4727 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 15:09:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22229 states. [2025-03-16 15:09:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22229 to 17443. [2025-03-16 15:09:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17443 states, 17442 states have (on average 1.0662768031189085) internal successors, (18598), 17442 states have internal predecessors, (18598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17443 states to 17443 states and 18598 transitions. [2025-03-16 15:09:57,290 INFO L78 Accepts]: Start accepts. Automaton has 17443 states and 18598 transitions. Word has length 579 [2025-03-16 15:09:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:57,290 INFO L471 AbstractCegarLoop]: Abstraction has 17443 states and 18598 transitions. [2025-03-16 15:09:57,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.22222222222223) internal successors, (740), 8 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 17443 states and 18598 transitions. [2025-03-16 15:09:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-16 15:09:57,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:57,294 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:57,301 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-16 15:09:57,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:57,495 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:57,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1378314353, now seen corresponding path program 1 times [2025-03-16 15:09:57,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:57,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009192928] [2025-03-16 15:09:57,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:57,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:57,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-16 15:09:57,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-16 15:09:57,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:57,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-16 15:09:57,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009192928] [2025-03-16 15:09:57,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009192928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:57,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:57,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949661840] [2025-03-16 15:09:57,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:57,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:57,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:57,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:57,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:57,764 INFO L87 Difference]: Start difference. First operand 17443 states and 18598 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:58,528 INFO L93 Difference]: Finished difference Result 38485 states and 41126 transitions. [2025-03-16 15:09:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:58,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 598 [2025-03-16 15:09:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:58,549 INFO L225 Difference]: With dead ends: 38485 [2025-03-16 15:09:58,549 INFO L226 Difference]: Without dead ends: 21043 [2025-03-16 15:09:58,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:58,562 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 291 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:58,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 568 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:09:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21043 states. [2025-03-16 15:09:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21043 to 20146. [2025-03-16 15:09:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20146 states, 20145 states have (on average 1.0579796475552246) internal successors, (21313), 20145 states have internal predecessors, (21313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20146 states to 20146 states and 21313 transitions. [2025-03-16 15:09:58,713 INFO L78 Accepts]: Start accepts. Automaton has 20146 states and 21313 transitions. Word has length 598 [2025-03-16 15:09:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:58,713 INFO L471 AbstractCegarLoop]: Abstraction has 20146 states and 21313 transitions. [2025-03-16 15:09:58,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 20146 states and 21313 transitions. [2025-03-16 15:09:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2025-03-16 15:09:58,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:58,717 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:58,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:09:58,717 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:58,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:58,718 INFO L85 PathProgramCache]: Analyzing trace with hash -529528586, now seen corresponding path program 1 times [2025-03-16 15:09:58,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:58,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309985047] [2025-03-16 15:09:58,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:58,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:58,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-03-16 15:09:58,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-03-16 15:09:58,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:58,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-03-16 15:09:58,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:58,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309985047] [2025-03-16 15:09:58,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309985047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:58,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19058698] [2025-03-16 15:09:58,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:58,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:58,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:58,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:58,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:58,906 INFO L87 Difference]: Start difference. First operand 20146 states and 21313 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:59,569 INFO L93 Difference]: Finished difference Result 40289 states and 42636 transitions. [2025-03-16 15:09:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:59,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 619 [2025-03-16 15:09:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:59,586 INFO L225 Difference]: With dead ends: 40289 [2025-03-16 15:09:59,586 INFO L226 Difference]: Without dead ends: 20443 [2025-03-16 15:09:59,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:59,597 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 436 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:59,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 68 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:09:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20443 states. [2025-03-16 15:09:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20443 to 20144. [2025-03-16 15:09:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20144 states, 20143 states have (on average 1.0578861142828775) internal successors, (21309), 20143 states have internal predecessors, (21309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20144 states to 20144 states and 21309 transitions. [2025-03-16 15:09:59,724 INFO L78 Accepts]: Start accepts. Automaton has 20144 states and 21309 transitions. Word has length 619 [2025-03-16 15:09:59,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:59,724 INFO L471 AbstractCegarLoop]: Abstraction has 20144 states and 21309 transitions. [2025-03-16 15:09:59,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 20144 states and 21309 transitions. [2025-03-16 15:09:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-16 15:09:59,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:59,728 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:59,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:09:59,728 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:59,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash -737763413, now seen corresponding path program 1 times [2025-03-16 15:09:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:59,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108620884] [2025-03-16 15:09:59,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:59,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-16 15:09:59,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-16 15:09:59,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:59,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-16 15:09:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:59,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108620884] [2025-03-16 15:09:59,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108620884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:59,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:59,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:09:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963944377] [2025-03-16 15:09:59,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:59,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:09:59,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:59,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:09:59,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:09:59,966 INFO L87 Difference]: Start difference. First operand 20144 states and 21309 transitions. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:01,142 INFO L93 Difference]: Finished difference Result 42977 states and 45512 transitions. [2025-03-16 15:10:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:10:01,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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 626 [2025-03-16 15:10:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:01,165 INFO L225 Difference]: With dead ends: 42977 [2025-03-16 15:10:01,165 INFO L226 Difference]: Without dead ends: 23133 [2025-03-16 15:10:01,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:10:01,178 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 668 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:01,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 418 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:10:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23133 states. [2025-03-16 15:10:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23133 to 22532. [2025-03-16 15:10:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22532 states, 22531 states have (on average 1.0468243753051352) internal successors, (23586), 22531 states have internal predecessors, (23586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 23586 transitions. [2025-03-16 15:10:01,396 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 23586 transitions. Word has length 626 [2025-03-16 15:10:01,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:01,396 INFO L471 AbstractCegarLoop]: Abstraction has 22532 states and 23586 transitions. [2025-03-16 15:10:01,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 23586 transitions. [2025-03-16 15:10:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-16 15:10:01,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:01,401 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:10:01,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:10:01,402 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:01,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:01,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2582319, now seen corresponding path program 1 times [2025-03-16 15:10:01,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:01,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060429325] [2025-03-16 15:10:01,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:01,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:01,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-16 15:10:01,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-16 15:10:01,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:01,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-16 15:10:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:01,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060429325] [2025-03-16 15:10:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060429325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:01,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:10:01,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931930021] [2025-03-16 15:10:01,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:01,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:10:01,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:01,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:10:01,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:01,698 INFO L87 Difference]: Start difference. First operand 22532 states and 23586 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:02,438 INFO L93 Difference]: Finished difference Result 50759 states and 53119 transitions. [2025-03-16 15:10:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:10:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 660 [2025-03-16 15:10:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:02,466 INFO L225 Difference]: With dead ends: 50759 [2025-03-16 15:10:02,466 INFO L226 Difference]: Without dead ends: 28527 [2025-03-16 15:10:02,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:02,480 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 226 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:02,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 474 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:10:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28527 states. [2025-03-16 15:10:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28527 to 21934. [2025-03-16 15:10:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21934 states, 21933 states have (on average 1.0475995075913007) internal successors, (22977), 21933 states have internal predecessors, (22977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21934 states to 21934 states and 22977 transitions. [2025-03-16 15:10:02,670 INFO L78 Accepts]: Start accepts. Automaton has 21934 states and 22977 transitions. Word has length 660 [2025-03-16 15:10:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:02,671 INFO L471 AbstractCegarLoop]: Abstraction has 21934 states and 22977 transitions. [2025-03-16 15:10:02,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 21934 states and 22977 transitions. [2025-03-16 15:10:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-16 15:10:02,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:02,675 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:10:02,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:10:02,675 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:02,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2046734831, now seen corresponding path program 1 times [2025-03-16 15:10:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:02,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072369520] [2025-03-16 15:10:02,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:02,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-16 15:10:02,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-16 15:10:02,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:02,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:10:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072369520] [2025-03-16 15:10:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072369520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:10:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100708859] [2025-03-16 15:10:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:02,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:10:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:02,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:10:02,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:02,965 INFO L87 Difference]: Start difference. First operand 21934 states and 22977 transitions. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:03,727 INFO L93 Difference]: Finished difference Result 45958 states and 48172 transitions. [2025-03-16 15:10:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:10:03,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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 673 [2025-03-16 15:10:03,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:03,748 INFO L225 Difference]: With dead ends: 45958 [2025-03-16 15:10:03,748 INFO L226 Difference]: Without dead ends: 24025 [2025-03-16 15:10:03,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:03,754 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 218 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:03,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 527 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:10:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24025 states. [2025-03-16 15:10:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24025 to 21322. [2025-03-16 15:10:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21322 states, 21321 states have (on average 1.045682660287979) internal successors, (22295), 21321 states have internal predecessors, (22295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21322 states to 21322 states and 22295 transitions. [2025-03-16 15:10:03,909 INFO L78 Accepts]: Start accepts. Automaton has 21322 states and 22295 transitions. Word has length 673 [2025-03-16 15:10:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:03,909 INFO L471 AbstractCegarLoop]: Abstraction has 21322 states and 22295 transitions. [2025-03-16 15:10:03,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 21322 states and 22295 transitions. [2025-03-16 15:10:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-16 15:10:03,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:03,913 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:10:03,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:10:03,913 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:03,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1422569007, now seen corresponding path program 1 times [2025-03-16 15:10:03,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:03,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250754047] [2025-03-16 15:10:03,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:03,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:03,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-16 15:10:03,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-16 15:10:03,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:03,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:10:04,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:04,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250754047] [2025-03-16 15:10:04,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250754047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:04,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:04,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:10:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485871952] [2025-03-16 15:10:04,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:04,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:10:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:04,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:10:04,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:04,203 INFO L87 Difference]: Start difference. First operand 21322 states and 22295 transitions. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:04,954 INFO L93 Difference]: Finished difference Result 46549 states and 48626 transitions. [2025-03-16 15:10:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:10:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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 673 [2025-03-16 15:10:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:04,980 INFO L225 Difference]: With dead ends: 46549 [2025-03-16 15:10:04,980 INFO L226 Difference]: Without dead ends: 25527 [2025-03-16 15:10:04,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:04,996 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 260 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:04,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 123 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:10:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25527 states. [2025-03-16 15:10:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25527 to 22219. [2025-03-16 15:10:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22219 states, 22218 states have (on average 1.044243406247187) internal successors, (23201), 22218 states have internal predecessors, (23201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22219 states to 22219 states and 23201 transitions. [2025-03-16 15:10:05,204 INFO L78 Accepts]: Start accepts. Automaton has 22219 states and 23201 transitions. Word has length 673 [2025-03-16 15:10:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:05,204 INFO L471 AbstractCegarLoop]: Abstraction has 22219 states and 23201 transitions. [2025-03-16 15:10:05,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 22219 states and 23201 transitions. [2025-03-16 15:10:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-16 15:10:05,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:05,209 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:10:05,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:10:05,209 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1308293456, now seen corresponding path program 1 times [2025-03-16 15:10:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559029012] [2025-03-16 15:10:05,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:05,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-16 15:10:05,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-16 15:10:05,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:05,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-16 15:10:05,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:05,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559029012] [2025-03-16 15:10:05,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559029012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:05,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:05,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:10:05,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116517090] [2025-03-16 15:10:05,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:05,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:10:05,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:05,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:10:05,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:05,530 INFO L87 Difference]: Start difference. First operand 22219 states and 23201 transitions. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:06,282 INFO L93 Difference]: Finished difference Result 47142 states and 49187 transitions. [2025-03-16 15:10:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:10:06,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 700 [2025-03-16 15:10:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:06,309 INFO L225 Difference]: With dead ends: 47142 [2025-03-16 15:10:06,309 INFO L226 Difference]: Without dead ends: 25223 [2025-03-16 15:10:06,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:06,325 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 351 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:06,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 115 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:10:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25223 states. [2025-03-16 15:10:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25223 to 21320. [2025-03-16 15:10:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21320 states, 21319 states have (on average 1.0440921243960786) internal successors, (22259), 21319 states have internal predecessors, (22259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21320 states to 21320 states and 22259 transitions. [2025-03-16 15:10:06,619 INFO L78 Accepts]: Start accepts. Automaton has 21320 states and 22259 transitions. Word has length 700 [2025-03-16 15:10:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:06,620 INFO L471 AbstractCegarLoop]: Abstraction has 21320 states and 22259 transitions. [2025-03-16 15:10:06,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 21320 states and 22259 transitions. [2025-03-16 15:10:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2025-03-16 15:10:06,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:06,628 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:10:06,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:10:06,629 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:06,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash 851966110, now seen corresponding path program 1 times [2025-03-16 15:10:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276978717] [2025-03-16 15:10:06,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:06,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 721 statements into 1 equivalence classes. [2025-03-16 15:10:06,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 721 of 721 statements. [2025-03-16 15:10:06,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:06,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-16 15:10:07,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:07,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276978717] [2025-03-16 15:10:07,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276978717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:07,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:07,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:10:07,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128272260] [2025-03-16 15:10:07,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:07,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:10:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:07,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:10:07,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:07,133 INFO L87 Difference]: Start difference. First operand 21320 states and 22259 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:07,840 INFO L93 Difference]: Finished difference Result 44133 states and 46111 transitions. [2025-03-16 15:10:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:10:07,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 721 [2025-03-16 15:10:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:07,861 INFO L225 Difference]: With dead ends: 44133 [2025-03-16 15:10:07,861 INFO L226 Difference]: Without dead ends: 22814 [2025-03-16 15:10:07,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:07,874 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 292 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:07,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 193 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:10:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22814 states. [2025-03-16 15:10:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22814 to 21617. [2025-03-16 15:10:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21617 states, 21616 states have (on average 1.0404330125832717) internal successors, (22490), 21616 states have internal predecessors, (22490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21617 states to 21617 states and 22490 transitions. [2025-03-16 15:10:08,037 INFO L78 Accepts]: Start accepts. Automaton has 21617 states and 22490 transitions. Word has length 721 [2025-03-16 15:10:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:08,038 INFO L471 AbstractCegarLoop]: Abstraction has 21617 states and 22490 transitions. [2025-03-16 15:10:08,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 21617 states and 22490 transitions. [2025-03-16 15:10:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2025-03-16 15:10:08,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:08,072 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:10:08,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:10:08,073 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:08,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -258924154, now seen corresponding path program 1 times [2025-03-16 15:10:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487379893] [2025-03-16 15:10:08,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:08,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-03-16 15:10:08,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-03-16 15:10:08,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:08,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:10:08,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:08,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487379893] [2025-03-16 15:10:08,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487379893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:08,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:08,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:10:08,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213432856] [2025-03-16 15:10:08,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:08,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:10:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:08,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:10:08,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:10:08,420 INFO L87 Difference]: Start difference. First operand 21617 states and 22490 transitions. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:09,485 INFO L93 Difference]: Finished difference Result 49530 states and 51477 transitions. [2025-03-16 15:10:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:10:09,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 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 723 [2025-03-16 15:10:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:09,510 INFO L225 Difference]: With dead ends: 49530 [2025-03-16 15:10:09,510 INFO L226 Difference]: Without dead ends: 28213 [2025-03-16 15:10:09,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:10:09,524 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 515 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:09,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 143 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:10:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28213 states. [2025-03-16 15:10:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28213 to 26117. [2025-03-16 15:10:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26117 states, 26116 states have (on average 1.038750191453515) internal successors, (27128), 26116 states have internal predecessors, (27128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26117 states to 26117 states and 27128 transitions. [2025-03-16 15:10:09,722 INFO L78 Accepts]: Start accepts. Automaton has 26117 states and 27128 transitions. Word has length 723 [2025-03-16 15:10:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:09,722 INFO L471 AbstractCegarLoop]: Abstraction has 26117 states and 27128 transitions. [2025-03-16 15:10:09,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand 26117 states and 27128 transitions. [2025-03-16 15:10:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-16 15:10:09,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:09,731 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:10:09,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:10:09,731 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:09,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash -181355691, now seen corresponding path program 1 times [2025-03-16 15:10:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113625452] [2025-03-16 15:10:09,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:09,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-16 15:10:09,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-16 15:10:09,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:09,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2025-03-16 15:10:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113625452] [2025-03-16 15:10:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113625452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:10,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:10,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:10:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646501550] [2025-03-16 15:10:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:10,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:10:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:10,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:10:10,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:10,027 INFO L87 Difference]: Start difference. First operand 26117 states and 27128 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:10,631 INFO L93 Difference]: Finished difference Result 42615 states and 44149 transitions. [2025-03-16 15:10:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:10:10,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 805 [2025-03-16 15:10:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:10,645 INFO L225 Difference]: With dead ends: 42615 [2025-03-16 15:10:10,645 INFO L226 Difference]: Without dead ends: 16798 [2025-03-16 15:10:10,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:10,657 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 314 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:10,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 403 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:10:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16798 states. [2025-03-16 15:10:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16798 to 14103. [2025-03-16 15:10:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14103 states, 14102 states have (on average 1.0266628846972061) internal successors, (14478), 14102 states have internal predecessors, (14478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14103 states to 14103 states and 14478 transitions. [2025-03-16 15:10:10,757 INFO L78 Accepts]: Start accepts. Automaton has 14103 states and 14478 transitions. Word has length 805 [2025-03-16 15:10:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:10,757 INFO L471 AbstractCegarLoop]: Abstraction has 14103 states and 14478 transitions. [2025-03-16 15:10:10,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14103 states and 14478 transitions. [2025-03-16 15:10:10,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-03-16 15:10:10,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:10,765 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:10:10,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 15:10:10,765 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:10,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1429505629, now seen corresponding path program 1 times [2025-03-16 15:10:10,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:10,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512248165] [2025-03-16 15:10:10,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:10,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-03-16 15:10:10,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-03-16 15:10:10,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:10,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2025-03-16 15:10:11,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512248165] [2025-03-16 15:10:11,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512248165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:11,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:11,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:10:11,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342271128] [2025-03-16 15:10:11,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:11,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:10:11,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:11,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:10:11,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:11,137 INFO L87 Difference]: Start difference. First operand 14103 states and 14478 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:11,736 INFO L93 Difference]: Finished difference Result 33307 states and 34223 transitions. [2025-03-16 15:10:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:10:11,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 839 [2025-03-16 15:10:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:11,753 INFO L225 Difference]: With dead ends: 33307 [2025-03-16 15:10:11,753 INFO L226 Difference]: Without dead ends: 19205 [2025-03-16 15:10:11,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:11,761 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 289 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:11,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 403 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:10:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19205 states. [2025-03-16 15:10:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19205 to 17402. [2025-03-16 15:10:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17402 states, 17401 states have (on average 1.0272972817654158) internal successors, (17876), 17401 states have internal predecessors, (17876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17402 states to 17402 states and 17876 transitions. [2025-03-16 15:10:11,887 INFO L78 Accepts]: Start accepts. Automaton has 17402 states and 17876 transitions. Word has length 839 [2025-03-16 15:10:11,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:11,887 INFO L471 AbstractCegarLoop]: Abstraction has 17402 states and 17876 transitions. [2025-03-16 15:10:11,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 17402 states and 17876 transitions. [2025-03-16 15:10:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2025-03-16 15:10:11,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:11,897 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:10:11,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 15:10:11,897 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:11,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2008962923, now seen corresponding path program 1 times [2025-03-16 15:10:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445910034] [2025-03-16 15:10:11,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:11,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 887 statements into 1 equivalence classes. [2025-03-16 15:10:11,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 887 of 887 statements. [2025-03-16 15:10:11,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:11,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2025-03-16 15:10:12,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:12,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445910034] [2025-03-16 15:10:12,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445910034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:12,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:12,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:10:12,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566354041] [2025-03-16 15:10:12,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:12,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:10:12,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:12,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:10:12,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:10:12,558 INFO L87 Difference]: Start difference. First operand 17402 states and 17876 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:13,081 INFO L93 Difference]: Finished difference Result 34808 states and 35756 transitions. [2025-03-16 15:10:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:10:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 887 [2025-03-16 15:10:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:13,096 INFO L225 Difference]: With dead ends: 34808 [2025-03-16 15:10:13,097 INFO L226 Difference]: Without dead ends: 17407 [2025-03-16 15:10:13,106 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-16 15:10:13,107 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 144 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:13,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 58 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:10:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17407 states. [2025-03-16 15:10:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17407 to 17103. [2025-03-16 15:10:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17103 states, 17102 states have (on average 1.025844930417495) internal successors, (17544), 17102 states have internal predecessors, (17544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17103 states to 17103 states and 17544 transitions. [2025-03-16 15:10:13,237 INFO L78 Accepts]: Start accepts. Automaton has 17103 states and 17544 transitions. Word has length 887 [2025-03-16 15:10:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:13,237 INFO L471 AbstractCegarLoop]: Abstraction has 17103 states and 17544 transitions. [2025-03-16 15:10:13,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17103 states and 17544 transitions. [2025-03-16 15:10:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2025-03-16 15:10:13,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:13,248 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-16 15:10:13,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 15:10:13,248 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:13,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:13,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1895708785, now seen corresponding path program 1 times [2025-03-16 15:10:13,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:13,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875154867] [2025-03-16 15:10:13,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:13,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:13,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 946 statements into 1 equivalence classes. [2025-03-16 15:10:13,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 946 of 946 statements. [2025-03-16 15:10:13,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:13,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 947 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-03-16 15:10:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:13,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875154867] [2025-03-16 15:10:13,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875154867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:13,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:10:13,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:10:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732805862] [2025-03-16 15:10:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:13,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:10:13,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:13,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:10:13,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:10:13,735 INFO L87 Difference]: Start difference. First operand 17103 states and 17544 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:14,663 INFO L93 Difference]: Finished difference Result 21302 states and 21834 transitions. [2025-03-16 15:10:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:10:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 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 946 [2025-03-16 15:10:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:14,683 INFO L225 Difference]: With dead ends: 21302 [2025-03-16 15:10:14,683 INFO L226 Difference]: Without dead ends: 21300 [2025-03-16 15:10:14,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:10:14,690 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 473 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:14,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 60 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:10:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21300 states. [2025-03-16 15:10:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21300 to 13803. [2025-03-16 15:10:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13803 states, 13802 states have (on average 1.0261556296188958) internal successors, (14163), 13802 states have internal predecessors, (14163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13803 states to 13803 states and 14163 transitions. [2025-03-16 15:10:14,868 INFO L78 Accepts]: Start accepts. Automaton has 13803 states and 14163 transitions. Word has length 946 [2025-03-16 15:10:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:14,869 INFO L471 AbstractCegarLoop]: Abstraction has 13803 states and 14163 transitions. [2025-03-16 15:10:14,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 13803 states and 14163 transitions. [2025-03-16 15:10:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2025-03-16 15:10:14,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:14,888 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:10:14,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 15:10:14,888 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:14,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2134931103, now seen corresponding path program 1 times [2025-03-16 15:10:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082677356] [2025-03-16 15:10:14,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:14,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1032 statements into 1 equivalence classes. [2025-03-16 15:10:15,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1032 of 1032 statements. [2025-03-16 15:10:15,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:15,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2025-03-16 15:10:15,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082677356] [2025-03-16 15:10:15,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082677356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:10:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439590241] [2025-03-16 15:10:15,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:15,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:10:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:10:15,776 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-16 15:10:15,777 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-16 15:10:15,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1032 statements into 1 equivalence classes. [2025-03-16 15:10:15,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1032 of 1032 statements. [2025-03-16 15:10:15,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:15,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:15,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:10:15,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:10:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2025-03-16 15:10:19,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:10:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2025-03-16 15:10:20,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439590241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:10:20,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:10:20,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-16 15:10:20,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033302377] [2025-03-16 15:10:20,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:10:20,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:10:20,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:20,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:10:20,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:10:20,207 INFO L87 Difference]: Start difference. First operand 13803 states and 14163 transitions. Second operand has 10 states, 10 states have (on average 111.1) internal successors, (1111), 9 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:22,965 INFO L93 Difference]: Finished difference Result 24301 states and 24897 transitions. [2025-03-16 15:10:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 15:10:22,965 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 111.1) internal successors, (1111), 9 states have internal predecessors, (1111), 0 states have call successors, (0), 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 1032 [2025-03-16 15:10:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:22,984 INFO L225 Difference]: With dead ends: 24301 [2025-03-16 15:10:22,984 INFO L226 Difference]: Without dead ends: 24299 [2025-03-16 15:10:22,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2072 GetRequests, 2058 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-16 15:10:22,989 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1963 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 3284 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1963 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 3284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:22,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1963 Valid, 109 Invalid, 3529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 3284 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:10:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24299 states. [2025-03-16 15:10:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24299 to 13504. [2025-03-16 15:10:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13504 states, 13503 states have (on average 1.0265866844404947) internal successors, (13862), 13503 states have internal predecessors, (13862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13504 states to 13504 states and 13862 transitions. [2025-03-16 15:10:23,118 INFO L78 Accepts]: Start accepts. Automaton has 13504 states and 13862 transitions. Word has length 1032 [2025-03-16 15:10:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:23,118 INFO L471 AbstractCegarLoop]: Abstraction has 13504 states and 13862 transitions. [2025-03-16 15:10:23,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.1) internal successors, (1111), 9 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 13504 states and 13862 transitions. [2025-03-16 15:10:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2025-03-16 15:10:23,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:23,129 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:10:23,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:10:23,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:10:23,330 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:23,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1558240340, now seen corresponding path program 1 times [2025-03-16 15:10:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702834360] [2025-03-16 15:10:23,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:23,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1143 statements into 1 equivalence classes. [2025-03-16 15:10:23,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1143 of 1143 statements. [2025-03-16 15:10:23,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:23,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2261 backedges. 1241 proven. 657 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-16 15:10:24,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:24,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702834360] [2025-03-16 15:10:24,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702834360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:10:24,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270685591] [2025-03-16 15:10:24,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:24,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:10:24,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:10:24,579 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-16 15:10:24,579 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-16 15:10:24,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1143 statements into 1 equivalence classes. [2025-03-16 15:10:24,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1143 of 1143 statements. [2025-03-16 15:10:24,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:24,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:24,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:10:24,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:10:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2261 backedges. 1510 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2025-03-16 15:10:25,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:10:25,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270685591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:25,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:10:25,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:10:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912386845] [2025-03-16 15:10:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:25,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:10:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:25,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:10:25,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:10:25,142 INFO L87 Difference]: Start difference. First operand 13504 states and 13862 transitions. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:25,659 INFO L93 Difference]: Finished difference Result 25505 states and 26175 transitions. [2025-03-16 15:10:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:10:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 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 1143 [2025-03-16 15:10:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:25,668 INFO L225 Difference]: With dead ends: 25505 [2025-03-16 15:10:25,668 INFO L226 Difference]: Without dead ends: 12301 [2025-03-16 15:10:25,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1148 GetRequests, 1143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:10:25,674 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 23 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:25,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 403 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:10:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2025-03-16 15:10:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 11402. [2025-03-16 15:10:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11402 states, 11401 states have (on average 1.0169283396193316) internal successors, (11594), 11401 states have internal predecessors, (11594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11402 states to 11402 states and 11594 transitions. [2025-03-16 15:10:25,768 INFO L78 Accepts]: Start accepts. Automaton has 11402 states and 11594 transitions. Word has length 1143 [2025-03-16 15:10:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:25,768 INFO L471 AbstractCegarLoop]: Abstraction has 11402 states and 11594 transitions. [2025-03-16 15:10:25,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 11402 states and 11594 transitions. [2025-03-16 15:10:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2025-03-16 15:10:25,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:25,779 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:10:25,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:10:25,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:10:25,979 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:25,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2011204455, now seen corresponding path program 1 times [2025-03-16 15:10:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:25,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65784700] [2025-03-16 15:10:25,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:26,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1153 statements into 1 equivalence classes. [2025-03-16 15:10:26,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1153 of 1153 statements. [2025-03-16 15:10:26,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:26,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 1394 proven. 152 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2025-03-16 15:10:27,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65784700] [2025-03-16 15:10:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65784700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:10:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966209956] [2025-03-16 15:10:27,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:27,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:10:27,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:10:27,806 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-16 15:10:27,808 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-16 15:10:27,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1153 statements into 1 equivalence classes. [2025-03-16 15:10:28,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1153 of 1153 statements. [2025-03-16 15:10:28,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:28,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:28,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:10:28,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:10:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 876 proven. 0 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2025-03-16 15:10:28,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:10:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966209956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:10:28,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:10:28,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-16 15:10:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952883742] [2025-03-16 15:10:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:10:28,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:10:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:28,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:10:28,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:10:28,291 INFO L87 Difference]: Start difference. First operand 11402 states and 11594 transitions. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:29,361 INFO L93 Difference]: Finished difference Result 18594 states and 18909 transitions. [2025-03-16 15:10:29,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:10:29,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 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 1153 [2025-03-16 15:10:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:29,363 INFO L225 Difference]: With dead ends: 18594 [2025-03-16 15:10:29,363 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:10:29,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1160 GetRequests, 1151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:10:29,369 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 774 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:29,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 75 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:10:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:10:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:10:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:10:29,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1153 [2025-03-16 15:10:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:29,371 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:10:29,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:10:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:10:29,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:10:29,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:10:29,381 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-16 15:10:29,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:10:29,580 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-16 15:10:29,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:10:45,641 WARN L286 SmtUtils]: Spent 16.06s on a formula simplification. DAG size of input: 699 DAG size of output: 810 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)