/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver Internal_SMTInterpol -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-02 19:55:11,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 19:55:12,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-02 19:55:12,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 19:55:12,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 19:55:12,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 19:55:12,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 19:55:12,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 19:55:12,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-02 19:55:12,057 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-02 19:55:12,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 19:55:12,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 19:55:12,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 19:55:12,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 19:55:12,058 INFO L153 SettingsManager]: * Use SBE=true [2024-11-02 19:55:12,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 19:55:12,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 19:55:12,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 19:55:12,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 19:55:12,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 19:55:12,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 19:55:12,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 19:55:12,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 19:55:12,065 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 19:55:12,066 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 19:55:12,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 19:55:12,066 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 19:55:12,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 19:55:12,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 19:55:12,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 19:55:12,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 19:55:12,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 19:55:12,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 19:55:12,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 19:55:12,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:55:12,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 19:55:12,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 19:55:12,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 19:55:12,068 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-02 19:55:12,068 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 19:55:12,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 19:55:12,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-02 19:55:12,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-02 19:55:12,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 19:55:12,070 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol [2024-11-02 19:55:12,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 19:55:12,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 19:55:12,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 19:55:12,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 19:55:12,269 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 19:55:12,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c [2024-11-02 19:55:13,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 19:55:13,722 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 19:55:13,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c [2024-11-02 19:55:13,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f6aceb97/fe5fd1aba91f4fd69157d7cd6b2b79e8/FLAG8c80b68d6 [2024-11-02 19:55:14,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f6aceb97/fe5fd1aba91f4fd69157d7cd6b2b79e8 [2024-11-02 19:55:14,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 19:55:14,116 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-02 19:55:14,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 19:55:14,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 19:55:14,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 19:55:14,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448015d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14, skipping insertion in model container [2024-11-02 19:55:14,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 19:55:14,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2024-11-02 19:55:14,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:55:14,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 19:55:14,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2024-11-02 19:55:14,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:55:14,415 INFO L204 MainTranslator]: Completed translation [2024-11-02 19:55:14,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14 WrapperNode [2024-11-02 19:55:14,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 19:55:14,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 19:55:14,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 19:55:14,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 19:55:14,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,462 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 470 [2024-11-02 19:55:14,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 19:55:14,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 19:55:14,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 19:55:14,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 19:55:14,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,492 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]. [2024-11-02 19:55:14,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 19:55:14,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 19:55:14,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 19:55:14,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 19:55:14,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (1/1) ... [2024-11-02 19:55:14,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:55:14,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-02 19:55:14,567 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) [2024-11-02 19:55:14,571 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 [2024-11-02 19:55:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 19:55:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-02 19:55:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 19:55:14,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 19:55:14,700 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 19:55:14,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 19:55:14,730 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-02 19:55:15,116 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2024-11-02 19:55:15,116 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2024-11-02 19:55:15,155 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-02 19:55:15,155 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 19:55:15,168 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 19:55:15,168 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-02 19:55:15,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:55:15 BoogieIcfgContainer [2024-11-02 19:55:15,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 19:55:15,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 19:55:15,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 19:55:15,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 19:55:15,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:55:14" (1/3) ... [2024-11-02 19:55:15,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502f86c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:55:15, skipping insertion in model container [2024-11-02 19:55:15,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:14" (2/3) ... [2024-11-02 19:55:15,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502f86c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:55:15, skipping insertion in model container [2024-11-02 19:55:15,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:55:15" (3/3) ... [2024-11-02 19:55:15,177 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2024-11-02 19:55:15,188 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 19:55:15,189 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 19:55:15,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 19:55:15,272 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;@742fad34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 19:55:15,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 19:55:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-02 19:55:15,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:15,281 INFO L215 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] [2024-11-02 19:55:15,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:15,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2024-11-02 19:55:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [165738612] [2024-11-02 19:55:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:15,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:15,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:15,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:15,474 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [165738612] [2024-11-02 19:55:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [165738612] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:15,474 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:15,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045458821] [2024-11-02 19:55:15,477 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:15,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:15,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:15,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:15,496 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:15,624 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2024-11-02 19:55:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:15,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-02 19:55:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:15,633 INFO L225 Difference]: With dead ends: 246 [2024-11-02 19:55:15,633 INFO L226 Difference]: Without dead ends: 112 [2024-11-02 19:55:15,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:15,638 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:15,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 319 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-02 19:55:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-02 19:55:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2024-11-02 19:55:15,672 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2024-11-02 19:55:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:15,672 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2024-11-02 19:55:15,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2024-11-02 19:55:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-02 19:55:15,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:15,676 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-02 19:55:15,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 19:55:15,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:15,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2024-11-02 19:55:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:15,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [932169496] [2024-11-02 19:55:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:15,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:15,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:15,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:55:15,854 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [932169496] [2024-11-02 19:55:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [932169496] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:15,855 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:15,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614004141] [2024-11-02 19:55:15,855 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:15,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:15,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:15,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:15,860 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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) [2024-11-02 19:55:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:15,993 INFO L93 Difference]: Finished difference Result 229 states and 350 transitions. [2024-11-02 19:55:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 [2024-11-02 19:55:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:15,996 INFO L225 Difference]: With dead ends: 229 [2024-11-02 19:55:15,996 INFO L226 Difference]: Without dead ends: 127 [2024-11-02 19:55:15,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:15,998 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:15,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 239 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-02 19:55:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-02 19:55:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2024-11-02 19:55:16,011 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2024-11-02 19:55:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:16,012 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2024-11-02 19:55:16,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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) [2024-11-02 19:55:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2024-11-02 19:55:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-02 19:55:16,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:16,013 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:16,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 19:55:16,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:16,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2024-11-02 19:55:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:16,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1545061450] [2024-11-02 19:55:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:16,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:16,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 19:55:16,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 19:55:16,109 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1545061450] [2024-11-02 19:55:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1545061450] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:16,109 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595973468] [2024-11-02 19:55:16,110 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:16,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:16,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:16,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:16,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:16,111 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:16,206 INFO L93 Difference]: Finished difference Result 261 states and 394 transitions. [2024-11-02 19:55:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 50 [2024-11-02 19:55:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:16,208 INFO L225 Difference]: With dead ends: 261 [2024-11-02 19:55:16,208 INFO L226 Difference]: Without dead ends: 144 [2024-11-02 19:55:16,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:16,209 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:16,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 252 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-02 19:55:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-02 19:55:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-02 19:55:16,215 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2024-11-02 19:55:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:16,216 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-02 19:55:16,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-02 19:55:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-02 19:55:16,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:16,217 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-02 19:55:16,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 19:55:16,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:16,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2024-11-02 19:55:16,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:16,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [83896243] [2024-11-02 19:55:16,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:16,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:16,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:16,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-02 19:55:16,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-02 19:55:16,333 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [83896243] [2024-11-02 19:55:16,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [83896243] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:16,334 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:16,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:16,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876534186] [2024-11-02 19:55:16,334 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:16,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:16,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:16,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:16,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:16,335 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:16,512 INFO L93 Difference]: Finished difference Result 341 states and 525 transitions. [2024-11-02 19:55:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 67 [2024-11-02 19:55:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:16,514 INFO L225 Difference]: With dead ends: 341 [2024-11-02 19:55:16,514 INFO L226 Difference]: Without dead ends: 207 [2024-11-02 19:55:16,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:16,516 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:16,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 249 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:55:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-02 19:55:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-02 19:55:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.441747572815534) internal successors, (297), 206 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2024-11-02 19:55:16,529 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 67 [2024-11-02 19:55:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:16,529 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2024-11-02 19:55:16,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2024-11-02 19:55:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-02 19:55:16,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:16,531 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-02 19:55:16,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 19:55:16,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:16,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1528022105, now seen corresponding path program 1 times [2024-11-02 19:55:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:16,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1969866443] [2024-11-02 19:55:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:16,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:16,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-02 19:55:16,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-02 19:55:16,648 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1969866443] [2024-11-02 19:55:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1969866443] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:16,648 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:16,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:16,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723202485] [2024-11-02 19:55:16,648 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:16,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:16,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:16,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:16,650 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:16,794 INFO L93 Difference]: Finished difference Result 423 states and 614 transitions. [2024-11-02 19:55:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:16,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 68 [2024-11-02 19:55:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:16,795 INFO L225 Difference]: With dead ends: 423 [2024-11-02 19:55:16,795 INFO L226 Difference]: Without dead ends: 226 [2024-11-02 19:55:16,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:16,797 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:16,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 257 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-02 19:55:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-02 19:55:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4266666666666667) internal successors, (321), 225 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 321 transitions. [2024-11-02 19:55:16,815 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 321 transitions. Word has length 68 [2024-11-02 19:55:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:16,815 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 321 transitions. [2024-11-02 19:55:16,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 321 transitions. [2024-11-02 19:55:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-02 19:55:16,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:16,820 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-02 19:55:16,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 19:55:16,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:16,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:16,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1678422895, now seen corresponding path program 1 times [2024-11-02 19:55:16,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:16,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981863852] [2024-11-02 19:55:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:16,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:16,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-02 19:55:16,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-02 19:55:16,952 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981863852] [2024-11-02 19:55:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1981863852] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:16,952 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:16,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885182699] [2024-11-02 19:55:16,953 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:16,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:16,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:16,954 INFO L87 Difference]: Start difference. First operand 226 states and 321 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:17,063 INFO L93 Difference]: Finished difference Result 463 states and 666 transitions. [2024-11-02 19:55:17,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:17,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-02 19:55:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:17,067 INFO L225 Difference]: With dead ends: 463 [2024-11-02 19:55:17,068 INFO L226 Difference]: Without dead ends: 247 [2024-11-02 19:55:17,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:17,069 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:17,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 256 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-02 19:55:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-02 19:55:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.410569105691057) internal successors, (347), 246 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 347 transitions. [2024-11-02 19:55:17,085 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 347 transitions. Word has length 84 [2024-11-02 19:55:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:17,085 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 347 transitions. [2024-11-02 19:55:17,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 347 transitions. [2024-11-02 19:55:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-02 19:55:17,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:17,087 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-11-02 19:55:17,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 19:55:17,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:17,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2024-11-02 19:55:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:17,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [366644349] [2024-11-02 19:55:17,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:17,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:17,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:55:17,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-02 19:55:17,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-02 19:55:17,271 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [366644349] [2024-11-02 19:55:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [366644349] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:17,272 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82068844] [2024-11-02 19:55:17,272 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:17,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:17,273 INFO L87 Difference]: Start difference. First operand 247 states and 347 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:17,314 INFO L93 Difference]: Finished difference Result 743 states and 1042 transitions. [2024-11-02 19:55:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:17,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-02 19:55:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:17,317 INFO L225 Difference]: With dead ends: 743 [2024-11-02 19:55:17,317 INFO L226 Difference]: Without dead ends: 506 [2024-11-02 19:55:17,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:17,318 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 257 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:17,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 381 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-02 19:55:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2024-11-02 19:55:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.39009900990099) internal successors, (702), 505 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 702 transitions. [2024-11-02 19:55:17,330 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 702 transitions. Word has length 103 [2024-11-02 19:55:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:17,330 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 702 transitions. [2024-11-02 19:55:17,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 702 transitions. [2024-11-02 19:55:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-02 19:55:17,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:17,331 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-11-02 19:55:17,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 19:55:17,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:17,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:17,332 INFO L85 PathProgramCache]: Analyzing trace with hash -847602632, now seen corresponding path program 1 times [2024-11-02 19:55:17,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:17,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913814191] [2024-11-02 19:55:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:17,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:17,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:17,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-02 19:55:17,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-02 19:55:17,418 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:17,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913814191] [2024-11-02 19:55:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1913814191] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:17,418 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:17,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232227521] [2024-11-02 19:55:17,418 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:17,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:17,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:17,420 INFO L87 Difference]: Start difference. First operand 506 states and 702 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:17,439 INFO L93 Difference]: Finished difference Result 1023 states and 1418 transitions. [2024-11-02 19:55:17,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:17,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-02 19:55:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:17,445 INFO L225 Difference]: With dead ends: 1023 [2024-11-02 19:55:17,445 INFO L226 Difference]: Without dead ends: 527 [2024-11-02 19:55:17,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:17,446 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 11 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:17,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-02 19:55:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-11-02 19:55:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3859315589353611) internal successors, (729), 526 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 729 transitions. [2024-11-02 19:55:17,461 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 729 transitions. Word has length 103 [2024-11-02 19:55:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:17,461 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 729 transitions. [2024-11-02 19:55:17,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 729 transitions. [2024-11-02 19:55:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-02 19:55:17,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:17,463 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-11-02 19:55:17,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 19:55:17,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:17,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1168582955, now seen corresponding path program 1 times [2024-11-02 19:55:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:17,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1871876607] [2024-11-02 19:55:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:17,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:17,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-02 19:55:17,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-02 19:55:17,556 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1871876607] [2024-11-02 19:55:17,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1871876607] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:17,556 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7032562] [2024-11-02 19:55:17,557 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:17,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:17,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:17,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:17,558 INFO L87 Difference]: Start difference. First operand 527 states and 729 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:17,575 INFO L93 Difference]: Finished difference Result 1070 states and 1478 transitions. [2024-11-02 19:55:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:17,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-02 19:55:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:17,580 INFO L225 Difference]: With dead ends: 1070 [2024-11-02 19:55:17,580 INFO L226 Difference]: Without dead ends: 553 [2024-11-02 19:55:17,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:17,581 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 20 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:17,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 309 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-02 19:55:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-02 19:55:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.3804347826086956) internal successors, (762), 552 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 762 transitions. [2024-11-02 19:55:17,592 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 762 transitions. Word has length 104 [2024-11-02 19:55:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:17,592 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 762 transitions. [2024-11-02 19:55:17,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 762 transitions. [2024-11-02 19:55:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-02 19:55:17,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:17,593 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-11-02 19:55:17,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 19:55:17,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:17,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2024-11-02 19:55:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2005479883] [2024-11-02 19:55:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:17,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:17,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-02 19:55:17,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-02 19:55:17,690 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2005479883] [2024-11-02 19:55:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2005479883] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:17,690 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:17,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651541055] [2024-11-02 19:55:17,691 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:17,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:17,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:17,692 INFO L87 Difference]: Start difference. First operand 553 states and 762 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:17,752 INFO L93 Difference]: Finished difference Result 1520 states and 2113 transitions. [2024-11-02 19:55:17,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:17,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 105 [2024-11-02 19:55:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:17,755 INFO L225 Difference]: With dead ends: 1520 [2024-11-02 19:55:17,755 INFO L226 Difference]: Without dead ends: 1003 [2024-11-02 19:55:17,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:17,756 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 259 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:17,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 590 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-11-02 19:55:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2024-11-02 19:55:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.3892215568862276) internal successors, (1392), 1002 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1392 transitions. [2024-11-02 19:55:17,795 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1392 transitions. Word has length 105 [2024-11-02 19:55:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:17,795 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1392 transitions. [2024-11-02 19:55:17,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1392 transitions. [2024-11-02 19:55:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-02 19:55:17,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:17,797 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2024-11-02 19:55:17,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 19:55:17,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:17,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:17,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2024-11-02 19:55:17,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:17,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [497874978] [2024-11-02 19:55:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:17,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:17,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-02 19:55:17,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-02 19:55:17,856 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:17,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [497874978] [2024-11-02 19:55:17,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [497874978] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:17,856 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:17,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:17,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287295876] [2024-11-02 19:55:17,856 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:17,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:17,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:17,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:17,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:17,857 INFO L87 Difference]: Start difference. First operand 1003 states and 1392 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:17,989 INFO L93 Difference]: Finished difference Result 2062 states and 2905 transitions. [2024-11-02 19:55:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:17,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 173 [2024-11-02 19:55:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:17,992 INFO L225 Difference]: With dead ends: 2062 [2024-11-02 19:55:17,992 INFO L226 Difference]: Without dead ends: 1095 [2024-11-02 19:55:17,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:17,993 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 75 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:17,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 219 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-02 19:55:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2024-11-02 19:55:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.3711151736745886) internal successors, (1500), 1094 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1500 transitions. [2024-11-02 19:55:18,010 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1500 transitions. Word has length 173 [2024-11-02 19:55:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:18,010 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1500 transitions. [2024-11-02 19:55:18,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1500 transitions. [2024-11-02 19:55:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-02 19:55:18,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:18,013 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2024-11-02 19:55:18,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 19:55:18,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:18,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2024-11-02 19:55:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1325828803] [2024-11-02 19:55:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:18,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:18,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-02 19:55:18,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-02 19:55:18,251 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:18,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1325828803] [2024-11-02 19:55:18,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1325828803] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:18,251 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:18,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276686209] [2024-11-02 19:55:18,251 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:18,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:18,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:18,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:18,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:18,252 INFO L87 Difference]: Start difference. First operand 1095 states and 1500 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:18,271 INFO L93 Difference]: Finished difference Result 2409 states and 3304 transitions. [2024-11-02 19:55:18,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:18,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-02 19:55:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:18,274 INFO L225 Difference]: With dead ends: 2409 [2024-11-02 19:55:18,275 INFO L226 Difference]: Without dead ends: 1350 [2024-11-02 19:55:18,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:18,276 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 111 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:18,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 466 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-11-02 19:55:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2024-11-02 19:55:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.369162342475908) internal successors, (1847), 1349 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1847 transitions. [2024-11-02 19:55:18,297 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1847 transitions. Word has length 194 [2024-11-02 19:55:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:18,298 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1847 transitions. [2024-11-02 19:55:18,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1847 transitions. [2024-11-02 19:55:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-02 19:55:18,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:18,300 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2024-11-02 19:55:18,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 19:55:18,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:18,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash 342847369, now seen corresponding path program 1 times [2024-11-02 19:55:18,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:18,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1068849782] [2024-11-02 19:55:18,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:18,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:18,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 19:55:18,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 458 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-02 19:55:18,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 442 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-02 19:55:18,878 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:18,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1068849782] [2024-11-02 19:55:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1068849782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:18,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:18,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-02 19:55:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629642873] [2024-11-02 19:55:18,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:18,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 19:55:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 19:55:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-02 19:55:18,880 INFO L87 Difference]: Start difference. First operand 1350 states and 1847 transitions. Second operand has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:19,314 INFO L93 Difference]: Finished difference Result 3030 states and 4192 transitions. [2024-11-02 19:55:19,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 19:55:19,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-11-02 19:55:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:19,319 INFO L225 Difference]: With dead ends: 3030 [2024-11-02 19:55:19,319 INFO L226 Difference]: Without dead ends: 1737 [2024-11-02 19:55:19,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-02 19:55:19,321 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 376 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:19,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 752 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 19:55:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2024-11-02 19:55:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1663. [2024-11-02 19:55:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 1.362214199759326) internal successors, (2264), 1662 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2264 transitions. [2024-11-02 19:55:19,350 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2264 transitions. Word has length 196 [2024-11-02 19:55:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:19,350 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2264 transitions. [2024-11-02 19:55:19,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2264 transitions. [2024-11-02 19:55:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-02 19:55:19,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:19,353 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 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] [2024-11-02 19:55:19,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 19:55:19,353 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:19,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash 228275513, now seen corresponding path program 1 times [2024-11-02 19:55:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1218742921] [2024-11-02 19:55:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:19,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:19,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-02 19:55:19,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-02 19:55:19,454 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:19,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1218742921] [2024-11-02 19:55:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1218742921] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:19,454 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940294379] [2024-11-02 19:55:19,454 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:19,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:19,455 INFO L87 Difference]: Start difference. First operand 1663 states and 2264 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:19,610 INFO L93 Difference]: Finished difference Result 3437 states and 4748 transitions. [2024-11-02 19:55:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:19,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 221 [2024-11-02 19:55:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:19,615 INFO L225 Difference]: With dead ends: 3437 [2024-11-02 19:55:19,615 INFO L226 Difference]: Without dead ends: 1831 [2024-11-02 19:55:19,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:19,617 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 77 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:19,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 248 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-02 19:55:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1831. [2024-11-02 19:55:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1830 states have (on average 1.3420765027322403) internal successors, (2456), 1830 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2456 transitions. [2024-11-02 19:55:19,651 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2456 transitions. Word has length 221 [2024-11-02 19:55:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:19,651 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2456 transitions. [2024-11-02 19:55:19,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2456 transitions. [2024-11-02 19:55:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-02 19:55:19,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:19,654 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:19,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 19:55:19,655 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:19,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash 629263864, now seen corresponding path program 1 times [2024-11-02 19:55:19,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:19,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839241443] [2024-11-02 19:55:19,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:19,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:19,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:19,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-02 19:55:19,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-02 19:55:19,739 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:19,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839241443] [2024-11-02 19:55:19,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1839241443] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:19,740 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:19,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:19,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338382396] [2024-11-02 19:55:19,740 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:19,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:19,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:19,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:19,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:19,741 INFO L87 Difference]: Start difference. First operand 1831 states and 2456 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:19,902 INFO L93 Difference]: Finished difference Result 3791 states and 5168 transitions. [2024-11-02 19:55:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:19,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 232 [2024-11-02 19:55:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:19,907 INFO L225 Difference]: With dead ends: 3791 [2024-11-02 19:55:19,907 INFO L226 Difference]: Without dead ends: 2017 [2024-11-02 19:55:19,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:19,910 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 84 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:19,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 261 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2024-11-02 19:55:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 2017. [2024-11-02 19:55:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 2016 states have (on average 1.3224206349206349) internal successors, (2666), 2016 states have internal predecessors, (2666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2666 transitions. [2024-11-02 19:55:19,946 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2666 transitions. Word has length 232 [2024-11-02 19:55:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:19,946 INFO L471 AbstractCegarLoop]: Abstraction has 2017 states and 2666 transitions. [2024-11-02 19:55:19,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2666 transitions. [2024-11-02 19:55:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-02 19:55:19,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:19,950 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 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] [2024-11-02 19:55:19,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-02 19:55:19,950 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:19,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:19,950 INFO L85 PathProgramCache]: Analyzing trace with hash -749493446, now seen corresponding path program 1 times [2024-11-02 19:55:19,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:19,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607020713] [2024-11-02 19:55:19,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:19,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:20,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:20,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-02 19:55:20,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-02 19:55:20,056 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607020713] [2024-11-02 19:55:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1607020713] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:20,056 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934395729] [2024-11-02 19:55:20,056 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:20,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:20,059 INFO L87 Difference]: Start difference. First operand 2017 states and 2666 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:20,235 INFO L93 Difference]: Finished difference Result 4199 states and 5642 transitions. [2024-11-02 19:55:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 262 [2024-11-02 19:55:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:20,242 INFO L225 Difference]: With dead ends: 4199 [2024-11-02 19:55:20,242 INFO L226 Difference]: Without dead ends: 2239 [2024-11-02 19:55:20,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:20,245 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 96 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:20,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 204 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2239 states. [2024-11-02 19:55:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2239 to 2239. [2024-11-02 19:55:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 2238 states have (on average 1.3011617515638962) internal successors, (2912), 2238 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 2912 transitions. [2024-11-02 19:55:20,313 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 2912 transitions. Word has length 262 [2024-11-02 19:55:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:20,313 INFO L471 AbstractCegarLoop]: Abstraction has 2239 states and 2912 transitions. [2024-11-02 19:55:20,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2912 transitions. [2024-11-02 19:55:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-02 19:55:20,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:20,317 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 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] [2024-11-02 19:55:20,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-02 19:55:20,317 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:20,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash -120716101, now seen corresponding path program 1 times [2024-11-02 19:55:20,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:20,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1321890379] [2024-11-02 19:55:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:20,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:20,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:55:20,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-11-02 19:55:20,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-11-02 19:55:20,453 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:20,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1321890379] [2024-11-02 19:55:20,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1321890379] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:20,453 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:20,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839706977] [2024-11-02 19:55:20,454 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:20,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:20,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:20,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:20,455 INFO L87 Difference]: Start difference. First operand 2239 states and 2912 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:20,544 INFO L93 Difference]: Finished difference Result 8587 states and 11198 transitions. [2024-11-02 19:55:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:20,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 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 263 [2024-11-02 19:55:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:20,559 INFO L225 Difference]: With dead ends: 8587 [2024-11-02 19:55:20,559 INFO L226 Difference]: Without dead ends: 6405 [2024-11-02 19:55:20,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:20,563 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 246 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:20,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 894 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2024-11-02 19:55:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6401. [2024-11-02 19:55:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6401 states, 6400 states have (on average 1.303125) internal successors, (8340), 6400 states have internal predecessors, (8340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 8340 transitions. [2024-11-02 19:55:20,722 INFO L78 Accepts]: Start accepts. Automaton has 6401 states and 8340 transitions. Word has length 263 [2024-11-02 19:55:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:20,722 INFO L471 AbstractCegarLoop]: Abstraction has 6401 states and 8340 transitions. [2024-11-02 19:55:20,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 8340 transitions. [2024-11-02 19:55:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-02 19:55:20,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:20,731 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:20,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-02 19:55:20,731 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:20,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1096027025, now seen corresponding path program 1 times [2024-11-02 19:55:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329979047] [2024-11-02 19:55:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:20,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:20,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2024-11-02 19:55:20,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2024-11-02 19:55:20,809 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329979047] [2024-11-02 19:55:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1329979047] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:20,809 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365072673] [2024-11-02 19:55:20,810 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:20,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:20,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:20,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:20,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:20,813 INFO L87 Difference]: Start difference. First operand 6401 states and 8340 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:21,017 INFO L93 Difference]: Finished difference Result 12943 states and 16948 transitions. [2024-11-02 19:55:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:21,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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 287 [2024-11-02 19:55:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:21,040 INFO L225 Difference]: With dead ends: 12943 [2024-11-02 19:55:21,040 INFO L226 Difference]: Without dead ends: 6599 [2024-11-02 19:55:21,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:21,050 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 91 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:21,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 250 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2024-11-02 19:55:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6599. [2024-11-02 19:55:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 6598 states have (on average 1.2958472264322523) internal successors, (8550), 6598 states have internal predecessors, (8550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 8550 transitions. [2024-11-02 19:55:21,216 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 8550 transitions. Word has length 287 [2024-11-02 19:55:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:21,216 INFO L471 AbstractCegarLoop]: Abstraction has 6599 states and 8550 transitions. [2024-11-02 19:55:21,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 8550 transitions. [2024-11-02 19:55:21,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-02 19:55:21,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:21,224 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:21,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-02 19:55:21,224 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:21,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1966900500, now seen corresponding path program 1 times [2024-11-02 19:55:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [527059018] [2024-11-02 19:55:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:21,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:21,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-02 19:55:21,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-02 19:55:21,304 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [527059018] [2024-11-02 19:55:21,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [527059018] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:21,305 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:21,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:21,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343803395] [2024-11-02 19:55:21,305 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:21,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:21,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:21,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:21,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:21,306 INFO L87 Difference]: Start difference. First operand 6599 states and 8550 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:21,575 INFO L93 Difference]: Finished difference Result 13807 states and 18178 transitions. [2024-11-02 19:55:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:21,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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 299 [2024-11-02 19:55:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:21,594 INFO L225 Difference]: With dead ends: 13807 [2024-11-02 19:55:21,594 INFO L226 Difference]: Without dead ends: 7265 [2024-11-02 19:55:21,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:21,601 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 92 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:21,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 201 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7265 states. [2024-11-02 19:55:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7265 to 7265. [2024-11-02 19:55:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7265 states, 7264 states have (on average 1.27863436123348) internal successors, (9288), 7264 states have internal predecessors, (9288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 9288 transitions. [2024-11-02 19:55:21,743 INFO L78 Accepts]: Start accepts. Automaton has 7265 states and 9288 transitions. Word has length 299 [2024-11-02 19:55:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:21,744 INFO L471 AbstractCegarLoop]: Abstraction has 7265 states and 9288 transitions. [2024-11-02 19:55:21,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7265 states and 9288 transitions. [2024-11-02 19:55:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-02 19:55:21,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:21,753 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2024-11-02 19:55:21,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-02 19:55:21,753 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:21,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:21,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1281776100, now seen corresponding path program 1 times [2024-11-02 19:55:21,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:21,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259412025] [2024-11-02 19:55:21,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:21,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:21,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:21,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2024-11-02 19:55:21,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2024-11-02 19:55:21,846 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259412025] [2024-11-02 19:55:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [259412025] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:21,846 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326039235] [2024-11-02 19:55:21,846 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:21,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:21,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:21,847 INFO L87 Difference]: Start difference. First operand 7265 states and 9288 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:22,136 INFO L93 Difference]: Finished difference Result 15229 states and 19780 transitions. [2024-11-02 19:55:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:22,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2024-11-02 19:55:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:22,149 INFO L225 Difference]: With dead ends: 15229 [2024-11-02 19:55:22,149 INFO L226 Difference]: Without dead ends: 8021 [2024-11-02 19:55:22,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:22,158 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 94 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:22,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 248 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8021 states. [2024-11-02 19:55:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8021 to 8003. [2024-11-02 19:55:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8003 states, 8002 states have (on average 1.2619345163709073) internal successors, (10098), 8002 states have internal predecessors, (10098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 10098 transitions. [2024-11-02 19:55:22,284 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 10098 transitions. Word has length 336 [2024-11-02 19:55:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:22,284 INFO L471 AbstractCegarLoop]: Abstraction has 8003 states and 10098 transitions. [2024-11-02 19:55:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 10098 transitions. [2024-11-02 19:55:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-02 19:55:22,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:22,293 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:22,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-02 19:55:22,294 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:22,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash -321729676, now seen corresponding path program 1 times [2024-11-02 19:55:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:22,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1337625466] [2024-11-02 19:55:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:22,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:55:22,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-02 19:55:22,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-02 19:55:22,482 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1337625466] [2024-11-02 19:55:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1337625466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:22,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:22,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-02 19:55:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406885633] [2024-11-02 19:55:22,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:22,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 19:55:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:22,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 19:55:22,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 19:55:22,483 INFO L87 Difference]: Start difference. First operand 8003 states and 10098 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:23,066 INFO L93 Difference]: Finished difference Result 25507 states and 32263 transitions. [2024-11-02 19:55:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 19:55:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 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 359 [2024-11-02 19:55:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:23,090 INFO L225 Difference]: With dead ends: 25507 [2024-11-02 19:55:23,090 INFO L226 Difference]: Without dead ends: 17561 [2024-11-02 19:55:23,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:55:23,101 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 379 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:23,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 771 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 19:55:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17561 states. [2024-11-02 19:55:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17561 to 10930. [2024-11-02 19:55:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10930 states, 10929 states have (on average 1.2780675267636563) internal successors, (13968), 10929 states have internal predecessors, (13968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10930 states to 10930 states and 13968 transitions. [2024-11-02 19:55:23,312 INFO L78 Accepts]: Start accepts. Automaton has 10930 states and 13968 transitions. Word has length 359 [2024-11-02 19:55:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:23,312 INFO L471 AbstractCegarLoop]: Abstraction has 10930 states and 13968 transitions. [2024-11-02 19:55:23,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 10930 states and 13968 transitions. [2024-11-02 19:55:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-02 19:55:23,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:23,327 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-11-02 19:55:23,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-02 19:55:23,327 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:23,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:23,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1433832451, now seen corresponding path program 1 times [2024-11-02 19:55:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:23,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [18802519] [2024-11-02 19:55:23,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:23,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:23,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:23,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 988 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-02 19:55:23,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 988 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-02 19:55:23,824 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:23,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [18802519] [2024-11-02 19:55:23,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [18802519] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:23,824 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:23,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:23,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302365873] [2024-11-02 19:55:23,824 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:23,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:23,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:23,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:23,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:23,825 INFO L87 Difference]: Start difference. First operand 10930 states and 13968 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:24,000 INFO L93 Difference]: Finished difference Result 27951 states and 35832 transitions. [2024-11-02 19:55:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:24,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 361 [2024-11-02 19:55:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:24,014 INFO L225 Difference]: With dead ends: 27951 [2024-11-02 19:55:24,014 INFO L226 Difference]: Without dead ends: 9802 [2024-11-02 19:55:24,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:24,028 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 83 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:24,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 394 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2024-11-02 19:55:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 8998. [2024-11-02 19:55:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8998 states, 8997 states have (on average 1.2640880293431143) internal successors, (11373), 8997 states have internal predecessors, (11373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8998 states to 8998 states and 11373 transitions. [2024-11-02 19:55:24,288 INFO L78 Accepts]: Start accepts. Automaton has 8998 states and 11373 transitions. Word has length 361 [2024-11-02 19:55:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:24,288 INFO L471 AbstractCegarLoop]: Abstraction has 8998 states and 11373 transitions. [2024-11-02 19:55:24,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8998 states and 11373 transitions. [2024-11-02 19:55:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-02 19:55:24,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:24,299 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 16, 14, 14, 12, 12, 10, 10, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 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] [2024-11-02 19:55:24,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-02 19:55:24,299 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:24,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash -447859215, now seen corresponding path program 1 times [2024-11-02 19:55:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [977551110] [2024-11-02 19:55:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:24,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:55:24,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2529 backedges. 1281 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2024-11-02 19:55:24,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2529 backedges. 1281 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2024-11-02 19:55:24,386 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:24,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [977551110] [2024-11-02 19:55:24,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [977551110] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:24,386 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:24,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:24,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578656919] [2024-11-02 19:55:24,387 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:24,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:24,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:24,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:24,388 INFO L87 Difference]: Start difference. First operand 8998 states and 11373 transitions. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:24,626 INFO L93 Difference]: Finished difference Result 17624 states and 22507 transitions. [2024-11-02 19:55:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 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 471 [2024-11-02 19:55:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:24,636 INFO L225 Difference]: With dead ends: 17624 [2024-11-02 19:55:24,636 INFO L226 Difference]: Without dead ends: 7372 [2024-11-02 19:55:24,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 938 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:24,644 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 86 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:24,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 257 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7372 states. [2024-11-02 19:55:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7372 to 7372. [2024-11-02 19:55:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7372 states, 7371 states have (on average 1.2420295753629087) internal successors, (9155), 7371 states have internal predecessors, (9155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7372 states to 7372 states and 9155 transitions. [2024-11-02 19:55:24,799 INFO L78 Accepts]: Start accepts. Automaton has 7372 states and 9155 transitions. Word has length 471 [2024-11-02 19:55:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:24,799 INFO L471 AbstractCegarLoop]: Abstraction has 7372 states and 9155 transitions. [2024-11-02 19:55:24,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 7372 states and 9155 transitions. [2024-11-02 19:55:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2024-11-02 19:55:24,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:24,806 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:24,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-02 19:55:24,806 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:24,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash 384313247, now seen corresponding path program 1 times [2024-11-02 19:55:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:24,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1624702605] [2024-11-02 19:55:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:24,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:24,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 19:55:24,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2915 backedges. 1653 proven. 14 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2024-11-02 19:55:24,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2915 backedges. 1653 proven. 14 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2024-11-02 19:55:24,980 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:24,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1624702605] [2024-11-02 19:55:24,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1624702605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:24,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:24,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-02 19:55:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357820026] [2024-11-02 19:55:24,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:24,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 19:55:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:24,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 19:55:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 19:55:24,982 INFO L87 Difference]: Start difference. First operand 7372 states and 9155 transitions. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:25,173 INFO L93 Difference]: Finished difference Result 7585 states and 9425 transitions. [2024-11-02 19:55:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 19:55:25,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 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 509 [2024-11-02 19:55:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:25,174 INFO L225 Difference]: With dead ends: 7585 [2024-11-02 19:55:25,174 INFO L226 Difference]: Without dead ends: 0 [2024-11-02 19:55:25,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 1014 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-02 19:55:25,178 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 95 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:25,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 256 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:55:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-02 19:55:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-02 19:55:25,179 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) [2024-11-02 19:55:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-02 19:55:25,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 509 [2024-11-02 19:55:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:25,179 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-02 19:55:25,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-02 19:55:25,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-02 19:55:25,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-02 19:55:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-02 19:55:25,184 INFO L407 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] [2024-11-02 19:55:25,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-02 19:55:31,327 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 19:55:31,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:55:31 BoogieIcfgContainer [2024-11-02 19:55:31,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 19:55:31,342 INFO L158 Benchmark]: Toolchain (without parser) took 17226.33ms. Allocated memory was 253.8MB in the beginning and 1.0GB in the end (delta: 792.7MB). Free memory was 221.5MB in the beginning and 895.7MB in the end (delta: -674.1MB). Peak memory consumption was 651.2MB. Max. memory is 8.0GB. [2024-11-02 19:55:31,342 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 253.8MB. Free memory is still 211.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-02 19:55:31,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.05ms. Allocated memory is still 253.8MB. Free memory was 221.5MB in the beginning and 203.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-02 19:55:31,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.17ms. Allocated memory is still 253.8MB. Free memory was 203.7MB in the beginning and 201.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-02 19:55:31,342 INFO L158 Benchmark]: Boogie Preprocessor took 64.48ms. Allocated memory is still 253.8MB. Free memory was 201.2MB in the beginning and 198.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-02 19:55:31,343 INFO L158 Benchmark]: RCFGBuilder took 641.89ms. Allocated memory is still 253.8MB. Free memory was 198.1MB in the beginning and 161.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2024-11-02 19:55:31,343 INFO L158 Benchmark]: TraceAbstraction took 16169.54ms. Allocated memory was 253.8MB in the beginning and 1.0GB in the end (delta: 792.7MB). Free memory was 160.7MB in the beginning and 895.7MB in the end (delta: -734.9MB). Peak memory consumption was 590.3MB. Max. memory is 8.0GB. [2024-11-02 19:55:31,344 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 253.8MB. Free memory is still 211.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.05ms. Allocated memory is still 253.8MB. Free memory was 221.5MB in the beginning and 203.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.17ms. Allocated memory is still 253.8MB. Free memory was 203.7MB in the beginning and 201.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.48ms. Allocated memory is still 253.8MB. Free memory was 201.2MB in the beginning and 198.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 641.89ms. Allocated memory is still 253.8MB. Free memory was 198.1MB in the beginning and 161.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16169.54ms. Allocated memory was 253.8MB in the beginning and 1.0GB in the end (delta: 792.7MB). Free memory was 160.7MB in the beginning and 895.7MB in the end (delta: -734.9MB). Peak memory consumption was 590.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 618]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 24, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2649 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2649 mSDsluCounter, 8610 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4244 mSDsCounter, 550 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3947 IncrementalHoareTripleChecker+Invalid, 4497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 550 mSolverCounterUnsat, 4366 mSDtfsCounter, 3947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9784 GetRequests, 9728 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10930occurred in iteration=21, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 7531 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 4907 NumberOfCodeBlocks, 4907 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 9766 ConstructedInterpolants, 0 QuantifiedInterpolants, 13155 SizeOfPredicates, 19 NumberOfNonLiveVariables, 5962 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 48 InterpolantComputations, 42 PerfectInterpolantSequences, 36614/36718 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (3 == s__state)) && (4368 != s__s3__tmp__next_state___0)) && (3 != blastFlag)) || (((((((4448 == s__state) && (61087 == ag_Y)) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (3 != blastFlag))) || ((((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (4384 == s__state)) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0)) && (3 != blastFlag))) || (((((((4432 == s__state) && (61087 == ag_Y)) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (3 != blastFlag))) || (((2 == blastFlag) && (3 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (4400 == s__state)) && (65535 == ag_X)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0)) && (3 != blastFlag))) || (((2 == blastFlag) && (4352 == s__state)) && (3 == s__s3__tmp__next_state___0))) || (((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (0 == s__hit)) && (4416 == s__state))) || ((4384 == s__state) && (1 == blastFlag))) || (((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (4560 == s__state)) && (65535 == ag_X)) && (4560 == s__s3__tmp__next_state___0)) && (0 == s__hit)) && (3 != blastFlag))) || (((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (4464 == s__state)) && (3 != blastFlag))) || ((0 == blastFlag) && (12292 == s__state))) || (((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4560 == s__s3__tmp__next_state___0)) && (0 == s__hit)) && (4352 == s__state)) && (3 != blastFlag))) || ((4560 == s__state) && (2 == blastFlag))) || (((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (65535 == ag_X)) && (4528 == s__state)) && (0 == s__hit)) && (3 != blastFlag))) || (((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (65535 == ag_X)) && (4512 == s__state)) && (0 == s__hit)) && (3 != blastFlag))) || (((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (4480 == s__state)) && (3 != blastFlag))) || (((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (4496 == s__state)) && (3 != blastFlag))) || ((4512 == s__state) && (2 == blastFlag))) || ((4528 == s__state) && (2 == blastFlag))) || ((((((((((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (5 != blastFlag)) && (65535 == ag_X)) && (16384 != s__state)) && (4560 == s__s3__tmp__next_state___0)) && (4368 != s__state)) && (4099 != s__state)) && (4096 != s__state)) && (0 == s__hit)) && (12292 != s__state)) && (20480 != s__state)) && (4369 != s__state)) && (3 != blastFlag))) || ((4368 == s__state) && (0 == blastFlag))) || ((2 == blastFlag) && (0 == s__hit))) RESULT: Ultimate proved your program to be correct! [2024-11-02 19:55:31,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...