/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_3.BV.c.cil-1a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-02 19:55:34,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 19:55:34,533 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:34,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 19:55:34,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 19:55:34,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 19:55:34,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 19:55:34,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 19:55:34,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-02 19:55:34,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-02 19:55:34,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 19:55:34,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 19:55:34,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 19:55:34,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 19:55:34,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-02 19:55:34,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 19:55:34,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 19:55:34,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 19:55:34,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 19:55:34,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 19:55:34,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 19:55:34,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 19:55:34,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 19:55:34,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 19:55:34,574 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 19:55:34,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 19:55:34,575 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 19:55:34,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 19:55:34,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 19:55:34,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 19:55:34,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 19:55:34,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 19:55:34,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 19:55:34,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 19:55:34,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:55:34,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 19:55:34,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 19:55:34,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 19:55:34,576 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-02 19:55:34,577 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 19:55:34,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 19:55:34,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-02 19:55:34,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-02 19:55:34,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 19:55:34,578 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:34,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 19:55:34,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 19:55:34,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 19:55:34,797 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 19:55:34,797 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 19:55:34,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1a.c [2024-11-02 19:55:35,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 19:55:36,188 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 19:55:36,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1a.c [2024-11-02 19:55:36,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8130898/4118ee41ccb94630a17824c746b1470c/FLAG5c1729ec6 [2024-11-02 19:55:36,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8130898/4118ee41ccb94630a17824c746b1470c [2024-11-02 19:55:36,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 19:55:36,592 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-02 19:55:36,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 19:55:36,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 19:55:36,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 19:55:36,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:55:36" (1/1) ... [2024-11-02 19:55:36,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c23b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:36, skipping insertion in model container [2024-11-02 19:55:36,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:55:36" (1/1) ... [2024-11-02 19:55:36,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 19:55:36,826 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_3.BV.c.cil-1a.c[37883,37896] [2024-11-02 19:55:36,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:55:36,843 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 19:55:36,891 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_3.BV.c.cil-1a.c[37883,37896] [2024-11-02 19:55:36,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:55:36,908 INFO L204 MainTranslator]: Completed translation [2024-11-02 19:55:36,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:36 WrapperNode [2024-11-02 19:55:36,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 19:55:36,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 19:55:36,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 19:55:36,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 19:55:36,919 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:36" (1/1) ... [2024-11-02 19:55:36,927 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:36" (1/1) ... [2024-11-02 19:55:36,949 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 474 [2024-11-02 19:55:36,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 19:55:36,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 19:55:36,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 19:55:36,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 19:55:36,961 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:36" (1/1) ... [2024-11-02 19:55:36,961 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:36" (1/1) ... [2024-11-02 19:55:36,966 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:36" (1/1) ... [2024-11-02 19:55:36,986 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:36,986 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:36" (1/1) ... [2024-11-02 19:55:36,986 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:36" (1/1) ... [2024-11-02 19:55:36,992 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:36" (1/1) ... [2024-11-02 19:55:36,999 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:36" (1/1) ... [2024-11-02 19:55:37,000 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:36" (1/1) ... [2024-11-02 19:55:37,001 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:36" (1/1) ... [2024-11-02 19:55:37,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 19:55:37,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 19:55:37,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 19:55:37,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 19:55:37,005 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:36" (1/1) ... [2024-11-02 19:55:37,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:55:37,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-02 19:55:37,039 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:37,046 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:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 19:55:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-02 19:55:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 19:55:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 19:55:37,134 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 19:55:37,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 19:55:37,152 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-02 19:55:37,497 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-11-02 19:55:37,497 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-11-02 19:55:37,526 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-02 19:55:37,526 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 19:55:37,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 19:55:37,536 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-02 19:55:37,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:55:37 BoogieIcfgContainer [2024-11-02 19:55:37,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 19:55:37,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 19:55:37,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 19:55:37,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 19:55:37,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:55:36" (1/3) ... [2024-11-02 19:55:37,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eca5839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:55:37, skipping insertion in model container [2024-11-02 19:55:37,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:36" (2/3) ... [2024-11-02 19:55:37,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eca5839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:55:37, skipping insertion in model container [2024-11-02 19:55:37,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:55:37" (3/3) ... [2024-11-02 19:55:37,542 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2024-11-02 19:55:37,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 19:55:37,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 19:55:37,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 19:55:37,605 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;@70a36259, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 19:55:37,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 19:55:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 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:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-02 19:55:37,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:37,615 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, 1] [2024-11-02 19:55:37,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:37,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash 259999105, now seen corresponding path program 1 times [2024-11-02 19:55:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [503617149] [2024-11-02 19:55:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:37,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:37,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:37,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:37,778 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:37,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:37,799 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:37,800 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [503617149] [2024-11-02 19:55:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [503617149] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:37,801 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:37,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384030687] [2024-11-02 19:55:37,805 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:37,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:37,828 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 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.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:38,073 INFO L93 Difference]: Finished difference Result 247 states and 423 transitions. [2024-11-02 19:55:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:38,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-02 19:55:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:38,085 INFO L225 Difference]: With dead ends: 247 [2024-11-02 19:55:38,085 INFO L226 Difference]: Without dead ends: 113 [2024-11-02 19:55:38,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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:38,089 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:38,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 320 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:55:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-02 19:55:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-02 19:55:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 112 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2024-11-02 19:55:38,119 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 25 [2024-11-02 19:55:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:38,119 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2024-11-02 19:55:38,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2024-11-02 19:55:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-02 19:55:38,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:38,120 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, 1] [2024-11-02 19:55:38,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 19:55:38,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:38,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1138040513, now seen corresponding path program 1 times [2024-11-02 19:55:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938089949] [2024-11-02 19:55:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:38,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:38,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:38,237 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:38,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:38,260 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:38,261 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:38,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938089949] [2024-11-02 19:55:38,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [938089949] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:38,261 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:38,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:38,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960035416] [2024-11-02 19:55:38,262 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:38,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:38,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:38,267 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:38,394 INFO L93 Difference]: Finished difference Result 230 states and 352 transitions. [2024-11-02 19:55:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:38,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-02 19:55:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:38,396 INFO L225 Difference]: With dead ends: 230 [2024-11-02 19:55:38,396 INFO L226 Difference]: Without dead ends: 128 [2024-11-02 19:55:38,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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:38,397 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:38,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-02 19:55:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-02 19:55:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.5039370078740157) internal successors, (191), 127 states have internal predecessors, (191), 0 states have call successors, (0), 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:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-11-02 19:55:38,407 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 37 [2024-11-02 19:55:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:38,407 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-11-02 19:55:38,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-11-02 19:55:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-02 19:55:38,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:38,409 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, 1] [2024-11-02 19:55:38,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 19:55:38,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:38,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1126420040, now seen corresponding path program 1 times [2024-11-02 19:55:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:38,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [610890630] [2024-11-02 19:55:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:38,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:38,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:38,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:38,524 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:38,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:38,568 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:38,568 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:38,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [610890630] [2024-11-02 19:55:38,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [610890630] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:38,569 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:38,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:38,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603983376] [2024-11-02 19:55:38,569 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:38,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:38,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:38,570 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:38,592 INFO L93 Difference]: Finished difference Result 271 states and 400 transitions. [2024-11-02 19:55:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:38,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2024-11-02 19:55:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:38,594 INFO L225 Difference]: With dead ends: 271 [2024-11-02 19:55:38,594 INFO L226 Difference]: Without dead ends: 154 [2024-11-02 19:55:38,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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:38,595 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 21 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 311 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:38,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 311 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:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-02 19:55:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-02 19:55:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 0 states have call successors, (0), 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:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-02 19:55:38,605 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 51 [2024-11-02 19:55:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:38,606 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-02 19:55:38,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-02 19:55:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-02 19:55:38,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:38,610 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, 1] [2024-11-02 19:55:38,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 19:55:38,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:38,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1260433546, now seen corresponding path program 1 times [2024-11-02 19:55:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:38,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127607291] [2024-11-02 19:55:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:38,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:38,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:38,749 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:38,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:38,765 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:38,766 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:38,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127607291] [2024-11-02 19:55:38,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2127607291] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:38,766 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:38,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:38,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170501810] [2024-11-02 19:55:38,766 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:38,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:38,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:38,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:38,768 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:38,867 INFO L93 Difference]: Finished difference Result 288 states and 429 transitions. [2024-11-02 19:55:38,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:38,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2024-11-02 19:55:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:38,869 INFO L225 Difference]: With dead ends: 288 [2024-11-02 19:55:38,869 INFO L226 Difference]: Without dead ends: 171 [2024-11-02 19:55:38,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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:38,870 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:38,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 255 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-02 19:55:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-02 19:55:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4470588235294117) internal successors, (246), 170 states have internal predecessors, (246), 0 states have call successors, (0), 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:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2024-11-02 19:55:38,886 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 51 [2024-11-02 19:55:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:38,886 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2024-11-02 19:55:38,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2024-11-02 19:55:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-02 19:55:38,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:38,892 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:38,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 19:55:38,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:38,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:38,893 INFO L85 PathProgramCache]: Analyzing trace with hash -457628469, now seen corresponding path program 1 times [2024-11-02 19:55:38,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:38,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1955178020] [2024-11-02 19:55:38,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:38,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:38,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:39,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:39,074 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:39,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:39,109 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:39,110 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1955178020] [2024-11-02 19:55:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1955178020] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:39,111 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892260238] [2024-11-02 19:55:39,111 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:39,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:39,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:39,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:39,112 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:39,154 INFO L93 Difference]: Finished difference Result 567 states and 833 transitions. [2024-11-02 19:55:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:39,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:39,156 INFO L225 Difference]: With dead ends: 567 [2024-11-02 19:55:39,156 INFO L226 Difference]: Without dead ends: 433 [2024-11-02 19:55:39,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 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:39,162 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 353 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:39,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 495 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-02 19:55:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2024-11-02 19:55:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 1.4560185185185186) internal successors, (629), 432 states have internal predecessors, (629), 0 states have call successors, (0), 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:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 629 transitions. [2024-11-02 19:55:39,192 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 629 transitions. Word has length 68 [2024-11-02 19:55:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:39,192 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 629 transitions. [2024-11-02 19:55:39,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 629 transitions. [2024-11-02 19:55:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-02 19:55:39,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:39,196 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, 1] [2024-11-02 19:55:39,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 19:55:39,197 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:39,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:39,197 INFO L85 PathProgramCache]: Analyzing trace with hash 562572643, now seen corresponding path program 1 times [2024-11-02 19:55:39,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:39,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1631856668] [2024-11-02 19:55:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:39,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:39,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:39,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 19:55:39,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 19:55:39,327 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:39,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1631856668] [2024-11-02 19:55:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1631856668] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:39,327 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:39,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:39,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659362730] [2024-11-02 19:55:39,327 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:39,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:39,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:39,328 INFO L87 Difference]: Start difference. First operand 433 states and 629 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:39,346 INFO L93 Difference]: Finished difference Result 850 states and 1237 transitions. [2024-11-02 19:55:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:39,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 69 [2024-11-02 19:55:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:39,348 INFO L225 Difference]: With dead ends: 850 [2024-11-02 19:55:39,348 INFO L226 Difference]: Without dead ends: 454 [2024-11-02 19:55:39,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 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:39,350 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 341 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:39,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 341 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:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-02 19:55:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2024-11-02 19:55:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.4481236203090508) internal successors, (656), 453 states have internal predecessors, (656), 0 states have call successors, (0), 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:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 656 transitions. [2024-11-02 19:55:39,365 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 656 transitions. Word has length 69 [2024-11-02 19:55:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:39,366 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 656 transitions. [2024-11-02 19:55:39,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 656 transitions. [2024-11-02 19:55:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-02 19:55:39,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:39,368 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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:39,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 19:55:39,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:39,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:39,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1304795004, now seen corresponding path program 1 times [2024-11-02 19:55:39,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:39,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [855764716] [2024-11-02 19:55:39,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:39,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:39,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:39,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-02 19:55:39,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-02 19:55:39,475 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:39,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [855764716] [2024-11-02 19:55:39,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [855764716] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:39,475 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:39,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94065397] [2024-11-02 19:55:39,475 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:39,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:39,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:39,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:39,476 INFO L87 Difference]: Start difference. First operand 454 states and 656 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:39,655 INFO L93 Difference]: Finished difference Result 985 states and 1467 transitions. [2024-11-02 19:55:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:39,658 INFO L225 Difference]: With dead ends: 985 [2024-11-02 19:55:39,658 INFO L226 Difference]: Without dead ends: 568 [2024-11-02 19:55:39,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 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:39,659 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 68 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:39,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 261 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:55:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-02 19:55:39,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2024-11-02 19:55:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 1.4479717813051147) internal successors, (821), 567 states have internal predecessors, (821), 0 states have call successors, (0), 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:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 821 transitions. [2024-11-02 19:55:39,683 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 821 transitions. Word has length 104 [2024-11-02 19:55:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:39,683 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 821 transitions. [2024-11-02 19:55:39,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 821 transitions. [2024-11-02 19:55:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-02 19:55:39,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:39,685 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 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] [2024-11-02 19:55:39,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 19:55:39,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:39,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1896690995, now seen corresponding path program 1 times [2024-11-02 19:55:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:39,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [294236896] [2024-11-02 19:55:39,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:39,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:55:39,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-02 19:55:39,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-02 19:55:39,813 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:39,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [294236896] [2024-11-02 19:55:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [294236896] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:39,814 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2024-11-02 19:55:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298740540] [2024-11-02 19:55:39,814 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:39,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 19:55:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:39,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 19:55:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 19:55:39,816 INFO L87 Difference]: Start difference. First operand 568 states and 821 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:40,010 INFO L93 Difference]: Finished difference Result 1186 states and 1752 transitions. [2024-11-02 19:55:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 19:55:40,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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 125 [2024-11-02 19:55:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:40,013 INFO L225 Difference]: With dead ends: 1186 [2024-11-02 19:55:40,013 INFO L226 Difference]: Without dead ends: 655 [2024-11-02 19:55:40,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-02 19:55:40,014 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 141 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:40,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 280 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:55:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-02 19:55:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2024-11-02 19:55:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.429663608562691) internal successors, (935), 654 states have internal predecessors, (935), 0 states have call successors, (0), 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:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 935 transitions. [2024-11-02 19:55:40,027 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 935 transitions. Word has length 125 [2024-11-02 19:55:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:40,027 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 935 transitions. [2024-11-02 19:55:40,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 935 transitions. [2024-11-02 19:55:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-02 19:55:40,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:40,029 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 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] [2024-11-02 19:55:40,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 19:55:40,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:40,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash 268550543, now seen corresponding path program 1 times [2024-11-02 19:55:40,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:40,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1834832879] [2024-11-02 19:55:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:40,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:40,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-02 19:55:40,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-02 19:55:40,123 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:40,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1834832879] [2024-11-02 19:55:40,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1834832879] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:40,123 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:40,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610832633] [2024-11-02 19:55:40,123 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:40,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:40,124 INFO L87 Difference]: Start difference. First operand 655 states and 935 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:40,275 INFO L93 Difference]: Finished difference Result 1323 states and 1907 transitions. [2024-11-02 19:55:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:40,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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 159 [2024-11-02 19:55:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:40,277 INFO L225 Difference]: With dead ends: 1323 [2024-11-02 19:55:40,278 INFO L226 Difference]: Without dead ends: 705 [2024-11-02 19:55:40,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 314 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:40,279 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 79 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:40,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 282 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-02 19:55:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-02 19:55:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.4090909090909092) internal successors, (992), 704 states have internal predecessors, (992), 0 states have call successors, (0), 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:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 992 transitions. [2024-11-02 19:55:40,292 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 992 transitions. Word has length 159 [2024-11-02 19:55:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:40,292 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 992 transitions. [2024-11-02 19:55:40,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 992 transitions. [2024-11-02 19:55:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-02 19:55:40,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:40,294 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 4, 4, 3, 3, 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] [2024-11-02 19:55:40,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 19:55:40,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:40,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash 260977371, now seen corresponding path program 1 times [2024-11-02 19:55:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:40,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1766110161] [2024-11-02 19:55:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:40,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:40,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-02 19:55:40,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-02 19:55:40,403 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:40,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1766110161] [2024-11-02 19:55:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1766110161] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:40,404 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:40,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770378744] [2024-11-02 19:55:40,404 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:40,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:40,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:40,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:40,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:40,405 INFO L87 Difference]: Start difference. First operand 705 states and 992 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:40,564 INFO L93 Difference]: Finished difference Result 1457 states and 2076 transitions. [2024-11-02 19:55:40,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:40,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 184 [2024-11-02 19:55:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:40,568 INFO L225 Difference]: With dead ends: 1457 [2024-11-02 19:55:40,568 INFO L226 Difference]: Without dead ends: 789 [2024-11-02 19:55:40,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 364 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:40,569 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 78 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:40,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 255 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-02 19:55:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2024-11-02 19:55:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.380710659898477) internal successors, (1088), 788 states have internal predecessors, (1088), 0 states have call successors, (0), 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:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1088 transitions. [2024-11-02 19:55:40,585 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1088 transitions. Word has length 184 [2024-11-02 19:55:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1088 transitions. [2024-11-02 19:55:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1088 transitions. [2024-11-02 19:55:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-02 19:55:40,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:40,587 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2024-11-02 19:55:40,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 19:55:40,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:40,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1428789822, now seen corresponding path program 1 times [2024-11-02 19:55:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [230442056] [2024-11-02 19:55:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:40,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:40,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-02 19:55:40,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-02 19:55:40,670 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:40,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [230442056] [2024-11-02 19:55:40,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [230442056] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:40,670 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:40,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:40,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338043345] [2024-11-02 19:55:40,671 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:40,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:40,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:40,672 INFO L87 Difference]: Start difference. First operand 789 states and 1088 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:40,813 INFO L93 Difference]: Finished difference Result 1634 states and 2286 transitions. [2024-11-02 19:55:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2024-11-02 19:55:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:40,816 INFO L225 Difference]: With dead ends: 1634 [2024-11-02 19:55:40,816 INFO L226 Difference]: Without dead ends: 882 [2024-11-02 19:55:40,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 386 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:40,818 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 83 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:40,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 209 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-02 19:55:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-11-02 19:55:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.3541430192962542) internal successors, (1193), 881 states have internal predecessors, (1193), 0 states have call successors, (0), 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:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1193 transitions. [2024-11-02 19:55:40,837 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1193 transitions. Word has length 195 [2024-11-02 19:55:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:40,837 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1193 transitions. [2024-11-02 19:55:40,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 19:55:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1193 transitions. [2024-11-02 19:55:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-02 19:55:40,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:40,839 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:40,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 19:55:40,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:40,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1690010114, now seen corresponding path program 1 times [2024-11-02 19:55:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:40,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796490725] [2024-11-02 19:55:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:40,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:55:40,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-02 19:55:40,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-02 19:55:40,993 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796490725] [2024-11-02 19:55:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1796490725] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:40,993 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410951543] [2024-11-02 19:55:40,993 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:40,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:40,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:40,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:40,995 INFO L87 Difference]: Start difference. First operand 882 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:41,076 INFO L93 Difference]: Finished difference Result 3327 states and 4520 transitions. [2024-11-02 19:55:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:41,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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 225 [2024-11-02 19:55:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:41,083 INFO L225 Difference]: With dead ends: 3327 [2024-11-02 19:55:41,083 INFO L226 Difference]: Without dead ends: 2482 [2024-11-02 19:55:41,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 446 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:41,084 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 246 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 898 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:41,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 898 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:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2024-11-02 19:55:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2478. [2024-11-02 19:55:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 1.3584981832862333) internal successors, (3365), 2477 states have internal predecessors, (3365), 0 states have call successors, (0), 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:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3365 transitions. [2024-11-02 19:55:41,154 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3365 transitions. Word has length 225 [2024-11-02 19:55:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:41,154 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 3365 transitions. [2024-11-02 19:55:41,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3365 transitions. [2024-11-02 19:55:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-02 19:55:41,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:41,158 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:41,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 19:55:41,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:41,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1388803456, now seen corresponding path program 1 times [2024-11-02 19:55:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:41,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183687908] [2024-11-02 19:55:41,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:41,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:41,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-02 19:55:41,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-02 19:55:41,275 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:41,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183687908] [2024-11-02 19:55:41,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [183687908] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:41,276 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:41,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:41,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974558201] [2024-11-02 19:55:41,276 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:41,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:41,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:41,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:41,278 INFO L87 Difference]: Start difference. First operand 2478 states and 3365 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:41,540 INFO L93 Difference]: Finished difference Result 5243 states and 7230 transitions. [2024-11-02 19:55:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:41,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 225 [2024-11-02 19:55:41,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:41,547 INFO L225 Difference]: With dead ends: 5243 [2024-11-02 19:55:41,547 INFO L226 Difference]: Without dead ends: 2802 [2024-11-02 19:55:41,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 446 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:41,550 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 97 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:41,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 252 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:55:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2024-11-02 19:55:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2802. [2024-11-02 19:55:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2802 states, 2801 states have (on average 1.3298821849339522) internal successors, (3725), 2801 states have internal predecessors, (3725), 0 states have call successors, (0), 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:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 3725 transitions. [2024-11-02 19:55:41,604 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 3725 transitions. Word has length 225 [2024-11-02 19:55:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:41,604 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 3725 transitions. [2024-11-02 19:55:41,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 3725 transitions. [2024-11-02 19:55:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-02 19:55:41,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:41,607 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 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:41,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 19:55:41,608 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:41,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash 644372403, now seen corresponding path program 1 times [2024-11-02 19:55:41,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:41,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786900609] [2024-11-02 19:55:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:41,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:41,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-02 19:55:41,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-02 19:55:41,682 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:41,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786900609] [2024-11-02 19:55:41,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [786900609] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:41,683 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163800112] [2024-11-02 19:55:41,683 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:41,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:41,684 INFO L87 Difference]: Start difference. First operand 2802 states and 3725 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:41,881 INFO L93 Difference]: Finished difference Result 5666 states and 7566 transitions. [2024-11-02 19:55:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:41,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2024-11-02 19:55:41,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:41,889 INFO L225 Difference]: With dead ends: 5666 [2024-11-02 19:55:41,889 INFO L226 Difference]: Without dead ends: 2901 [2024-11-02 19:55:41,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 496 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:41,892 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 92 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:41,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 207 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2024-11-02 19:55:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2901. [2024-11-02 19:55:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2900 states have (on average 1.3206896551724139) internal successors, (3830), 2900 states have internal predecessors, (3830), 0 states have call successors, (0), 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:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3830 transitions. [2024-11-02 19:55:41,950 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 3830 transitions. Word has length 250 [2024-11-02 19:55:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:41,951 INFO L471 AbstractCegarLoop]: Abstraction has 2901 states and 3830 transitions. [2024-11-02 19:55:41,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3830 transitions. [2024-11-02 19:55:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-02 19:55:41,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:41,954 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 19:55:41,954 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:41,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1036748406, now seen corresponding path program 1 times [2024-11-02 19:55:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:41,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048478602] [2024-11-02 19:55:41,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:41,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:41,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-02 19:55:42,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-02 19:55:42,034 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048478602] [2024-11-02 19:55:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2048478602] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:42,034 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:42,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:42,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210374602] [2024-11-02 19:55:42,034 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:42,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:42,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:42,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:42,035 INFO L87 Difference]: Start difference. First operand 2901 states and 3830 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:42,210 INFO L93 Difference]: Finished difference Result 6098 states and 8169 transitions. [2024-11-02 19:55:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:42,219 INFO L225 Difference]: With dead ends: 6098 [2024-11-02 19:55:42,219 INFO L226 Difference]: Without dead ends: 3234 [2024-11-02 19:55:42,222 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:42,222 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:42,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 204 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2024-11-02 19:55:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 3234. [2024-11-02 19:55:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3233 states have (on average 1.2987936900711414) internal successors, (4199), 3233 states have internal predecessors, (4199), 0 states have call successors, (0), 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:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4199 transitions. [2024-11-02 19:55:42,327 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4199 transitions. Word has length 262 [2024-11-02 19:55:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:42,328 INFO L471 AbstractCegarLoop]: Abstraction has 3234 states and 4199 transitions. [2024-11-02 19:55:42,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4199 transitions. [2024-11-02 19:55:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-02 19:55:42,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:42,332 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-02 19:55:42,332 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 119696682, now seen corresponding path program 1 times [2024-11-02 19:55:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:42,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1897094829] [2024-11-02 19:55:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:42,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:42,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-11-02 19:55:42,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-11-02 19:55:42,872 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1897094829] [2024-11-02 19:55:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1897094829] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:42,873 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:42,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:42,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459798914] [2024-11-02 19:55:42,873 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:42,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:42,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:42,874 INFO L87 Difference]: Start difference. First operand 3234 states and 4199 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:42,943 INFO L93 Difference]: Finished difference Result 9630 states and 12499 transitions. [2024-11-02 19:55:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:42,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:42,958 INFO L225 Difference]: With dead ends: 9630 [2024-11-02 19:55:42,959 INFO L226 Difference]: Without dead ends: 6433 [2024-11-02 19:55:42,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 595 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:42,963 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 69 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:42,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 325 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6433 states. [2024-11-02 19:55:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6433 to 6431. [2024-11-02 19:55:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6431 states, 6430 states have (on average 1.294090202177294) internal successors, (8321), 6430 states have internal predecessors, (8321), 0 states have call successors, (0), 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:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6431 states to 6431 states and 8321 transitions. [2024-11-02 19:55:43,128 INFO L78 Accepts]: Start accepts. Automaton has 6431 states and 8321 transitions. Word has length 299 [2024-11-02 19:55:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:43,128 INFO L471 AbstractCegarLoop]: Abstraction has 6431 states and 8321 transitions. [2024-11-02 19:55:43,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 6431 states and 8321 transitions. [2024-11-02 19:55:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-02 19:55:43,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:43,135 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-02 19:55:43,135 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:43,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1613367898, now seen corresponding path program 1 times [2024-11-02 19:55:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:43,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456907500] [2024-11-02 19:55:43,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:43,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 19:55:43,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2024-11-02 19:55:43,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2024-11-02 19:55:43,768 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:43,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1456907500] [2024-11-02 19:55:43,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1456907500] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:43,769 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:43,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 19:55:43,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910437198] [2024-11-02 19:55:43,769 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:43,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 19:55:43,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:43,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 19:55:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 19:55:43,770 INFO L87 Difference]: Start difference. First operand 6431 states and 8321 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:43,911 INFO L93 Difference]: Finished difference Result 9621 states and 12436 transitions. [2024-11-02 19:55:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:55:43,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:43,934 INFO L225 Difference]: With dead ends: 9621 [2024-11-02 19:55:43,934 INFO L226 Difference]: Without dead ends: 6433 [2024-11-02 19:55:43,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 595 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:43,944 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 61 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:43,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 466 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:55:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6433 states. [2024-11-02 19:55:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6433 to 6431. [2024-11-02 19:55:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6431 states, 6430 states have (on average 1.289891135303266) internal successors, (8294), 6430 states have internal predecessors, (8294), 0 states have call successors, (0), 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:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6431 states to 6431 states and 8294 transitions. [2024-11-02 19:55:44,089 INFO L78 Accepts]: Start accepts. Automaton has 6431 states and 8294 transitions. Word has length 299 [2024-11-02 19:55:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:44,089 INFO L471 AbstractCegarLoop]: Abstraction has 6431 states and 8294 transitions. [2024-11-02 19:55:44,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6431 states and 8294 transitions. [2024-11-02 19:55:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-02 19:55:44,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:44,096 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-02 19:55:44,096 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:44,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash 876161064, now seen corresponding path program 1 times [2024-11-02 19:55:44,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:44,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1390429831] [2024-11-02 19:55:44,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:44,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:44,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:55:44,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-02 19:55:44,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-02 19:55:44,190 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:44,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1390429831] [2024-11-02 19:55:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1390429831] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:55:44,191 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:55:44,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:55:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103723501] [2024-11-02 19:55:44,192 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:55:44,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:55:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:55:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:55:44,193 INFO L87 Difference]: Start difference. First operand 6431 states and 8294 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:44,425 INFO L93 Difference]: Finished difference Result 13543 states and 17736 transitions. [2024-11-02 19:55:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:55:44,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:44,436 INFO L225 Difference]: With dead ends: 13543 [2024-11-02 19:55:44,436 INFO L226 Difference]: Without dead ends: 7178 [2024-11-02 19:55:44,441 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:44,441 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 97 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:44,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 206 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:55:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7178 states. [2024-11-02 19:55:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7178 to 7160. [2024-11-02 19:55:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7160 states, 7159 states have (on average 1.2704288308422964) internal successors, (9095), 7159 states have internal predecessors, (9095), 0 states have call successors, (0), 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:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7160 states to 7160 states and 9095 transitions. [2024-11-02 19:55:44,556 INFO L78 Accepts]: Start accepts. Automaton has 7160 states and 9095 transitions. Word has length 299 [2024-11-02 19:55:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:44,557 INFO L471 AbstractCegarLoop]: Abstraction has 7160 states and 9095 transitions. [2024-11-02 19:55:44,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7160 states and 9095 transitions. [2024-11-02 19:55:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-02 19:55:44,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:44,566 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:44,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-02 19:55:44,566 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -828156331, now seen corresponding path program 1 times [2024-11-02 19:55:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1860559068] [2024-11-02 19:55:44,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:44,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:55:44,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-02 19:55:44,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-02 19:55:44,753 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:44,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1860559068] [2024-11-02 19:55:44,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1860559068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:44,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-02 19:55:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579814764] [2024-11-02 19:55:44,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:44,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 19:55:44,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:44,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 19:55:44,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 19:55:44,755 INFO L87 Difference]: Start difference. First operand 7160 states and 9095 transitions. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 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:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:45,312 INFO L93 Difference]: Finished difference Result 15124 states and 19179 transitions. [2024-11-02 19:55:45,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 19:55:45,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2024-11-02 19:55:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:45,322 INFO L225 Difference]: With dead ends: 15124 [2024-11-02 19:55:45,322 INFO L226 Difference]: Without dead ends: 4784 [2024-11-02 19:55:45,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-02 19:55:45,330 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 293 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:45,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 721 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 19:55:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2024-11-02 19:55:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 3863. [2024-11-02 19:55:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3862 states have (on average 1.294665976178146) internal successors, (5000), 3862 states have internal predecessors, (5000), 0 states have call successors, (0), 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:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 5000 transitions. [2024-11-02 19:55:45,398 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 5000 transitions. Word has length 308 [2024-11-02 19:55:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:45,398 INFO L471 AbstractCegarLoop]: Abstraction has 3863 states and 5000 transitions. [2024-11-02 19:55:45,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 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:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 5000 transitions. [2024-11-02 19:55:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-02 19:55:45,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:45,403 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:45,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-02 19:55:45,404 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:45,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1703634950, now seen corresponding path program 1 times [2024-11-02 19:55:45,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:45,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [5024308] [2024-11-02 19:55:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:45,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:55:45,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 19:55:45,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 480 proven. 13 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-02 19:55:45,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 480 proven. 13 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-02 19:55:45,731 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:45,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [5024308] [2024-11-02 19:55:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [5024308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:45,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:45,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-02 19:55:45,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923696437] [2024-11-02 19:55:45,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:45,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 19:55:45,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:45,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 19:55:45,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 19:55:45,733 INFO L87 Difference]: Start difference. First operand 3863 states and 5000 transitions. Second operand has 8 states, 8 states have (on average 28.0) internal successors, (224), 8 states have internal predecessors, (224), 0 states have call successors, (0), 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:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:46,164 INFO L93 Difference]: Finished difference Result 6597 states and 8452 transitions. [2024-11-02 19:55:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 19:55:46,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.0) internal successors, (224), 8 states have internal predecessors, (224), 0 states have call successors, (0), 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 310 [2024-11-02 19:55:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:46,166 INFO L225 Difference]: With dead ends: 6597 [2024-11-02 19:55:46,166 INFO L226 Difference]: Without dead ends: 0 [2024-11-02 19:55:46,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:55:46,172 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 333 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:46,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 614 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 19:55:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-02 19:55:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-02 19:55:46,176 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:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-02 19:55:46,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 310 [2024-11-02 19:55:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:46,177 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-02 19:55:46,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.0) internal successors, (224), 8 states have internal predecessors, (224), 0 states have call successors, (0), 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:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-02 19:55:46,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-02 19:55:46,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-02 19:55:46,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-02 19:55:46,182 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] [2024-11-02 19:55:46,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-02 19:55:48,591 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 19:55:48,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:55:48 BoogieIcfgContainer [2024-11-02 19:55:48,611 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 19:55:48,611 INFO L158 Benchmark]: Toolchain (without parser) took 12019.00ms. Allocated memory was 200.3MB in the beginning and 706.7MB in the end (delta: 506.5MB). Free memory was 141.2MB in the beginning and 645.4MB in the end (delta: -504.2MB). Peak memory consumption was 407.9MB. Max. memory is 8.0GB. [2024-11-02 19:55:48,611 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 200.3MB. Free memory was 152.7MB in the beginning and 152.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-02 19:55:48,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.25ms. Allocated memory is still 200.3MB. Free memory was 140.8MB in the beginning and 123.3MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-02 19:55:48,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.47ms. Allocated memory is still 200.3MB. Free memory was 123.3MB in the beginning and 120.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-02 19:55:48,612 INFO L158 Benchmark]: Boogie Preprocessor took 53.99ms. Allocated memory is still 200.3MB. Free memory was 120.6MB in the beginning and 117.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-02 19:55:48,613 INFO L158 Benchmark]: RCFGBuilder took 532.41ms. Allocated memory was 200.3MB in the beginning and 305.1MB in the end (delta: 104.9MB). Free memory was 117.4MB in the beginning and 257.7MB in the end (delta: -140.3MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. [2024-11-02 19:55:48,613 INFO L158 Benchmark]: TraceAbstraction took 11072.57ms. Allocated memory was 305.1MB in the beginning and 706.7MB in the end (delta: 401.6MB). Free memory was 257.2MB in the beginning and 645.4MB in the end (delta: -388.2MB). Peak memory consumption was 418.1MB. Max. memory is 8.0GB. [2024-11-02 19:55:48,614 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.21ms. Allocated memory is still 200.3MB. Free memory was 152.7MB in the beginning and 152.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 314.25ms. Allocated memory is still 200.3MB. Free memory was 140.8MB in the beginning and 123.3MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.47ms. Allocated memory is still 200.3MB. Free memory was 123.3MB in the beginning and 120.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.99ms. Allocated memory is still 200.3MB. Free memory was 120.6MB in the beginning and 117.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 532.41ms. Allocated memory was 200.3MB in the beginning and 305.1MB in the end (delta: 104.9MB). Free memory was 117.4MB in the beginning and 257.7MB in the end (delta: -140.3MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11072.57ms. Allocated memory was 305.1MB in the beginning and 706.7MB in the end (delta: 401.6MB). Free memory was 257.2MB in the beginning and 645.4MB in the end (delta: -388.2MB). Peak memory consumption was 418.1MB. 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: 624]: 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, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 20, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2241 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2241 mSDsluCounter, 7144 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3646 mSDsCounter, 471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3481 IncrementalHoareTripleChecker+Invalid, 3952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 471 mSolverCounterUnsat, 3498 mSDtfsCounter, 3481 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7062 GetRequests, 7016 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7160occurred in iteration=18, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 947 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 3545 NumberOfCodeBlocks, 3545 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 7050 ConstructedInterpolants, 0 QuantifiedInterpolants, 11133 SizeOfPredicates, 15 NumberOfNonLiveVariables, 4415 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 40 InterpolantComputations, 36 PerfectInterpolantSequences, 20470/20520 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: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((4432 == s__state) && (5 != blastFlag)) || (2 == blastFlag)) || ((4384 == s__state) && (1 == blastFlag))) || ((((5 != blastFlag) && (0 != s__hit)) && (4352 == s__state)) && (3 == s__s3__tmp__next_state___0))) || ((5 != blastFlag) && (4416 == s__state))) || ((0 == blastFlag) && (12292 == s__state))) || ((5 != blastFlag) && (4512 == s__state))) || ((5 != blastFlag) && (4528 == s__state))) || ((((((((((((5 != blastFlag) && (4384 != s__state)) && (16384 != s__state)) && (4560 == s__s3__tmp__next_state___0)) && (4368 != s__state)) && (4099 != s__state)) && (4096 != s__state)) && (0 == s__hit)) && (4385 != s__state)) && (12292 != s__state)) && (20480 != s__state)) && (4369 != s__state))) || ((5 != blastFlag) && (4496 == s__state))) || ((5 != blastFlag) && (4480 == s__state))) || ((((5 != blastFlag) && (0 != s__hit)) && (3 == s__state)) && (3 == s__s3__tmp__next_state___0))) || ((4368 == s__state) && (0 == blastFlag))) || ((4448 == s__state) && (5 != blastFlag))) || ((5 != blastFlag) && (4464 == s__state))) RESULT: Ultimate proved your program to be correct! [2024-11-02 19:55:48,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...