/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/floats-nonlinear/color-sendmoremoney.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-02 21:06:36,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 21:06:36,911 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 21:06:36,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 21:06:36,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 21:06:36,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 21:06:36,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 21:06:36,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 21:06:36,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-02 21:06:36,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-02 21:06:36,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 21:06:36,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 21:06:36,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 21:06:36,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 21:06:36,943 INFO L153 SettingsManager]: * Use SBE=true [2024-11-02 21:06:36,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 21:06:36,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 21:06:36,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 21:06:36,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 21:06:36,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 21:06:36,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 21:06:36,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 21:06:36,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 21:06:36,946 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 21:06:36,946 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 21:06:36,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 21:06:36,947 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 21:06:36,947 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 21:06:36,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 21:06:36,948 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 21:06:36,948 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 21:06:36,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 21:06:36,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 21:06:36,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 21:06:36,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 21:06:36,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 21:06:36,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 21:06:36,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 21:06:36,950 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-02 21:06:36,950 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 21:06:36,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 21:06:36,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-02 21:06:36,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-02 21:06:36,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 21:06:36,952 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 21:06:37,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 21:06:37,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 21:06:37,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 21:06:37,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 21:06:37,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 21:06:37,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c [2024-11-02 21:06:38,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 21:06:38,844 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 21:06:38,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c [2024-11-02 21:06:38,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2499f83b2/a54751b61ea84f979a0c68558d1cb73f/FLAG1e99ba2c8 [2024-11-02 21:06:38,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2499f83b2/a54751b61ea84f979a0c68558d1cb73f [2024-11-02 21:06:38,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 21:06:38,869 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-02 21:06:38,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 21:06:38,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 21:06:38,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 21:06:38,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:06:38" (1/1) ... [2024-11-02 21:06:38,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8478d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:38, skipping insertion in model container [2024-11-02 21:06:38,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:06:38" (1/1) ... [2024-11-02 21:06:38,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 21:06:39,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-02 21:06:39,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 21:06:39,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 21:06:39,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-02 21:06:39,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 21:06:39,142 INFO L204 MainTranslator]: Completed translation [2024-11-02 21:06:39,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39 WrapperNode [2024-11-02 21:06:39,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 21:06:39,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 21:06:39,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 21:06:39,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 21:06:39,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,183 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2024-11-02 21:06:39,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 21:06:39,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 21:06:39,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 21:06:39,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 21:06:39,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,208 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-02 21:06:39,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 21:06:39,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 21:06:39,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 21:06:39,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 21:06:39,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (1/1) ... [2024-11-02 21:06:39,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 21:06:39,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-02 21:06:39,260 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 21:06:39,268 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 21:06:39,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 21:06:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-02 21:06:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-02 21:06:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-02 21:06:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-02 21:06:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-02 21:06:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-02 21:06:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-02 21:06:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 21:06:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 21:06:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-02 21:06:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-02 21:06:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-02 21:06:39,296 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-02 21:06:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 21:06:39,406 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 21:06:39,409 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 21:06:39,761 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-02 21:06:39,762 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 21:06:39,774 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 21:06:39,774 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-02 21:06:39,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:06:39 BoogieIcfgContainer [2024-11-02 21:06:39,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 21:06:39,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 21:06:39,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 21:06:39,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 21:06:39,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:06:38" (1/3) ... [2024-11-02 21:06:39,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4479a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:06:39, skipping insertion in model container [2024-11-02 21:06:39,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:39" (2/3) ... [2024-11-02 21:06:39,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4479a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:06:39, skipping insertion in model container [2024-11-02 21:06:39,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:06:39" (3/3) ... [2024-11-02 21:06:39,786 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-02 21:06:39,800 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 21:06:39,801 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 21:06:39,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 21:06:39,858 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;@2e603eae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 21:06:39,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 21:06:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-02 21:06:39,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:39,873 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, 1, 1] [2024-11-02 21:06:39,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:39,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash -871385011, now seen corresponding path program 1 times [2024-11-02 21:06:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [857163696] [2024-11-02 21:06:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:40,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-02 21:06:40,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:40,242 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 21:06:40,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:40,291 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 21:06:40,292 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [857163696] [2024-11-02 21:06:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [857163696] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:40,293 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2024-11-02 21:06:40,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298125135] [2024-11-02 21:06:40,295 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:40,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 21:06:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:40,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 21:06:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 21:06:40,316 INFO L87 Difference]: Start difference. First operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 21:06:40,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:40,372 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2024-11-02 21:06:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:40,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-02 21:06:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:40,382 INFO L225 Difference]: With dead ends: 77 [2024-11-02 21:06:40,382 INFO L226 Difference]: Without dead ends: 54 [2024-11-02 21:06:40,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 21:06:40,387 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:40,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-02 21:06:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-02 21:06:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2024-11-02 21:06:40,430 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 27 [2024-11-02 21:06:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:40,431 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-11-02 21:06:40,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 21:06:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-11-02 21:06:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-02 21:06:40,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:40,434 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, 1, 1] [2024-11-02 21:06:40,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 21:06:40,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash -871444593, now seen corresponding path program 1 times [2024-11-02 21:06:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1680597620] [2024-11-02 21:06:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:40,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 21:06:40,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:40,557 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 21:06:40,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:40,575 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 21:06:40,576 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:40,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1680597620] [2024-11-02 21:06:40,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1680597620] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:40,576 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:40,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-02 21:06:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337566397] [2024-11-02 21:06:40,577 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:40,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 21:06:40,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:40,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 21:06:40,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 21:06:40,579 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 21:06:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:40,630 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-02 21:06:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 21:06:40,632 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-02 21:06:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:40,633 INFO L225 Difference]: With dead ends: 59 [2024-11-02 21:06:40,633 INFO L226 Difference]: Without dead ends: 54 [2024-11-02 21:06:40,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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 21:06:40,634 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:40,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-02 21:06:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-02 21:06:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2024-11-02 21:06:40,650 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 27 [2024-11-02 21:06:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:40,651 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2024-11-02 21:06:40,651 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 21:06:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2024-11-02 21:06:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-02 21:06:40,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:40,653 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, 1, 1, 1, 1, 1] [2024-11-02 21:06:40,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 21:06:40,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:40,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash 458394128, now seen corresponding path program 1 times [2024-11-02 21:06:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673703849] [2024-11-02 21:06:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:40,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-02 21:06:40,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:40,802 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 21:06:40,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:40,860 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 21:06:40,860 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:40,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673703849] [2024-11-02 21:06:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1673703849] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:40,861 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:40,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-02 21:06:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992640586] [2024-11-02 21:06:40,861 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:40,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 21:06:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:40,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 21:06:40,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-02 21:06:40,866 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 21:06:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:40,920 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2024-11-02 21:06:40,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 21:06:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-02 21:06:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:40,925 INFO L225 Difference]: With dead ends: 105 [2024-11-02 21:06:40,926 INFO L226 Difference]: Without dead ends: 58 [2024-11-02 21:06:40,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-02 21:06:40,929 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:40,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 331 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-02 21:06:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-02 21:06:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-02 21:06:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-02 21:06:40,943 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 30 [2024-11-02 21:06:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:40,943 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-02 21:06:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 21:06:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-02 21:06:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-02 21:06:40,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:40,945 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, 1, 1, 1, 1, 1] [2024-11-02 21:06:40,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 21:06:40,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:40,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash 489413935, now seen corresponding path program 1 times [2024-11-02 21:06:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:40,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464054684] [2024-11-02 21:06:40,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:40,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:41,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 21:06:41,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:41,081 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 21:06:41,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:41,106 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 21:06:41,106 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1464054684] [2024-11-02 21:06:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1464054684] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:41,107 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:41,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-02 21:06:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221043977] [2024-11-02 21:06:41,107 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:41,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,109 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 21:06:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:41,196 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2024-11-02 21:06:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-02 21:06:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:41,202 INFO L225 Difference]: With dead ends: 73 [2024-11-02 21:06:41,202 INFO L226 Difference]: Without dead ends: 58 [2024-11-02 21:06:41,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,204 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:41,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 21:06:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-02 21:06:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-02 21:06:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-02 21:06:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2024-11-02 21:06:41,219 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 30 [2024-11-02 21:06:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:41,219 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2024-11-02 21:06:41,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 21:06:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2024-11-02 21:06:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-02 21:06:41,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:41,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 21:06:41,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 21:06:41,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:41,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1216513705, now seen corresponding path program 1 times [2024-11-02 21:06:41,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:41,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [280186623] [2024-11-02 21:06:41,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:41,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 21:06:41,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:41,329 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 21:06:41,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:41,351 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 21:06:41,351 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:41,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [280186623] [2024-11-02 21:06:41,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [280186623] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:41,352 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:41,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-02 21:06:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794848123] [2024-11-02 21:06:41,353 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:41,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:41,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,357 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-02 21:06:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:41,425 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2024-11-02 21:06:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-02 21:06:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:41,427 INFO L225 Difference]: With dead ends: 81 [2024-11-02 21:06:41,427 INFO L226 Difference]: Without dead ends: 58 [2024-11-02 21:06:41,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,428 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:41,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 21:06:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-02 21:06:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-02 21:06:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-02 21:06:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2024-11-02 21:06:41,445 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 36 [2024-11-02 21:06:41,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:41,445 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2024-11-02 21:06:41,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-02 21:06:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2024-11-02 21:06:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-02 21:06:41,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:41,450 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-02 21:06:41,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 21:06:41,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:41,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash -483978296, now seen corresponding path program 1 times [2024-11-02 21:06:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:41,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [354152009] [2024-11-02 21:06:41,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:41,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:41,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 21:06:41,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-02 21:06:41,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-02 21:06:41,556 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [354152009] [2024-11-02 21:06:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [354152009] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:41,557 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:41,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-02 21:06:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274404521] [2024-11-02 21:06:41,557 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:41,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:41,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:41,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:41,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,561 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-02 21:06:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:41,600 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2024-11-02 21:06:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:41,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-02 21:06:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:41,602 INFO L225 Difference]: With dead ends: 85 [2024-11-02 21:06:41,602 INFO L226 Difference]: Without dead ends: 58 [2024-11-02 21:06:41,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,607 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:41,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-02 21:06:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-02 21:06:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-02 21:06:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2024-11-02 21:06:41,614 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 42 [2024-11-02 21:06:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:41,614 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2024-11-02 21:06:41,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-02 21:06:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2024-11-02 21:06:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-02 21:06:41,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:41,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:06:41,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 21:06:41,617 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:41,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:41,617 INFO L85 PathProgramCache]: Analyzing trace with hash 122397324, now seen corresponding path program 1 times [2024-11-02 21:06:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275760754] [2024-11-02 21:06:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:41,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 21:06:41,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-02 21:06:41,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-02 21:06:41,720 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:41,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275760754] [2024-11-02 21:06:41,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1275760754] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:41,720 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:41,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-02 21:06:41,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778265842] [2024-11-02 21:06:41,721 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:41,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:41,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:41,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:41,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,723 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-02 21:06:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:41,764 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-11-02 21:06:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:41,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-11-02 21:06:41,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:41,766 INFO L225 Difference]: With dead ends: 89 [2024-11-02 21:06:41,766 INFO L226 Difference]: Without dead ends: 58 [2024-11-02 21:06:41,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,767 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:41,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-02 21:06:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-02 21:06:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-02 21:06:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-11-02 21:06:41,783 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 48 [2024-11-02 21:06:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:41,784 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-11-02 21:06:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-02 21:06:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-11-02 21:06:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-02 21:06:41,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:41,786 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 21:06:41,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 21:06:41,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:41,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:41,787 INFO L85 PathProgramCache]: Analyzing trace with hash 768951279, now seen corresponding path program 1 times [2024-11-02 21:06:41,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:41,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661010937] [2024-11-02 21:06:41,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:41,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:41,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 21:06:41,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-02 21:06:41,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-02 21:06:41,907 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:41,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661010937] [2024-11-02 21:06:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [661010937] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:41,908 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:41,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-02 21:06:41,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682814391] [2024-11-02 21:06:41,908 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:41,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:41,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:41,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:41,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,911 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-02 21:06:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:41,946 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2024-11-02 21:06:41,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:41,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2024-11-02 21:06:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:41,949 INFO L225 Difference]: With dead ends: 99 [2024-11-02 21:06:41,949 INFO L226 Difference]: Without dead ends: 58 [2024-11-02 21:06:41,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:41,951 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:41,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-02 21:06:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-02 21:06:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-02 21:06:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-11-02 21:06:41,962 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 54 [2024-11-02 21:06:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:41,963 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-11-02 21:06:41,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-02 21:06:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-11-02 21:06:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-02 21:06:41,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:41,968 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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 21:06:41,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 21:06:41,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2055983107, now seen corresponding path program 1 times [2024-11-02 21:06:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1452895327] [2024-11-02 21:06:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:42,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 21:06:42,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-02 21:06:42,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-02 21:06:42,073 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:42,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1452895327] [2024-11-02 21:06:42,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1452895327] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:42,073 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:42,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-02 21:06:42,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918534663] [2024-11-02 21:06:42,074 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:42,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:42,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:42,076 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-02 21:06:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:42,106 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2024-11-02 21:06:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:42,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 60 [2024-11-02 21:06:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:42,107 INFO L225 Difference]: With dead ends: 103 [2024-11-02 21:06:42,107 INFO L226 Difference]: Without dead ends: 58 [2024-11-02 21:06:42,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:42,108 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:42,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-02 21:06:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-02 21:06:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-02 21:06:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-11-02 21:06:42,121 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 60 [2024-11-02 21:06:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:42,121 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-11-02 21:06:42,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-02 21:06:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-11-02 21:06:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-02 21:06:42,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:42,122 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-11-02 21:06:42,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 21:06:42,122 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:42,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1824557136, now seen corresponding path program 1 times [2024-11-02 21:06:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:42,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [577271980] [2024-11-02 21:06:42,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:42,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:42,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 21:06:42,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-02 21:06:42,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-02 21:06:42,217 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [577271980] [2024-11-02 21:06:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [577271980] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:42,217 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:42,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-02 21:06:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706961887] [2024-11-02 21:06:42,218 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:42,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:42,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:42,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:42,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:42,219 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-02 21:06:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:42,245 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2024-11-02 21:06:42,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:42,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 66 [2024-11-02 21:06:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:42,247 INFO L225 Difference]: With dead ends: 107 [2024-11-02 21:06:42,247 INFO L226 Difference]: Without dead ends: 58 [2024-11-02 21:06:42,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:42,248 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:42,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-02 21:06:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-11-02 21:06:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-02 21:06:42,253 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 66 [2024-11-02 21:06:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:42,253 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-02 21:06:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-02 21:06:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-02 21:06:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-02 21:06:42,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:42,254 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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 21:06:42,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 21:06:42,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash 761216169, now seen corresponding path program 1 times [2024-11-02 21:06:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [208124141] [2024-11-02 21:06:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:42,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 21:06:42,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-02 21:06:42,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-02 21:06:42,445 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:42,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [208124141] [2024-11-02 21:06:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [208124141] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:42,445 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 21:06:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734462126] [2024-11-02 21:06:42,446 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:42,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:42,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:42,447 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:42,481 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2024-11-02 21:06:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-11-02 21:06:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:42,483 INFO L225 Difference]: With dead ends: 70 [2024-11-02 21:06:42,483 INFO L226 Difference]: Without dead ends: 63 [2024-11-02 21:06:42,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 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 21:06:42,484 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:42,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 118 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-02 21:06:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-11-02 21:06:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2024-11-02 21:06:42,491 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 72 [2024-11-02 21:06:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:42,492 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2024-11-02 21:06:42,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-11-02 21:06:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-02 21:06:42,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:42,497 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-11-02 21:06:42,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 21:06:42,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:42,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:42,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1352872087, now seen corresponding path program 1 times [2024-11-02 21:06:42,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:42,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393302324] [2024-11-02 21:06:42,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:42,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:42,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 21:06:42,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-02 21:06:42,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-02 21:06:42,616 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393302324] [2024-11-02 21:06:42,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [393302324] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:42,616 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:42,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-02 21:06:42,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474259008] [2024-11-02 21:06:42,616 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:42,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:42,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:42,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:42,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:42,618 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:42,663 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-11-02 21:06:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:42,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-02 21:06:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:42,665 INFO L225 Difference]: With dead ends: 67 [2024-11-02 21:06:42,665 INFO L226 Difference]: Without dead ends: 61 [2024-11-02 21:06:42,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:42,666 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:42,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-02 21:06:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-02 21:06:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2024-11-02 21:06:42,670 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 73 [2024-11-02 21:06:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:42,671 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2024-11-02 21:06:42,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-11-02 21:06:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-02 21:06:42,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:42,672 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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 21:06:42,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 21:06:42,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:42,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1231189799, now seen corresponding path program 1 times [2024-11-02 21:06:42,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:42,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626104444] [2024-11-02 21:06:42,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:42,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:42,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 21:06:42,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-02 21:06:42,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-02 21:06:42,851 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:42,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626104444] [2024-11-02 21:06:42,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [626104444] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 21:06:42,851 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 21:06:42,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 21:06:42,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283752386] [2024-11-02 21:06:42,852 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 21:06:42,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 21:06:42,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:42,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 21:06:42,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 21:06:42,853 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:42,878 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2024-11-02 21:06:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 21:06:42,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-02 21:06:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:42,880 INFO L225 Difference]: With dead ends: 83 [2024-11-02 21:06:42,880 INFO L226 Difference]: Without dead ends: 67 [2024-11-02 21:06:42,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 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 21:06:42,881 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:42,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 117 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 21:06:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-02 21:06:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-11-02 21:06:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2024-11-02 21:06:42,887 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 80 [2024-11-02 21:06:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:42,888 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2024-11-02 21:06:42,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2024-11-02 21:06:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-02 21:06:42,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:42,890 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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 21:06:42,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 21:06:42,891 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:42,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:42,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1279031657, now seen corresponding path program 1 times [2024-11-02 21:06:42,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:42,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [181996303] [2024-11-02 21:06:42,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:42,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:43,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 21:06:43,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-02 21:06:43,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-02 21:06:43,117 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [181996303] [2024-11-02 21:06:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [181996303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 21:06:43,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 21:06:43,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-02 21:06:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697004069] [2024-11-02 21:06:43,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 21:06:43,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 21:06:43,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:43,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 21:06:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-02 21:06:43,118 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:43,282 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2024-11-02 21:06:43,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-02 21:06:43,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 86 [2024-11-02 21:06:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:43,283 INFO L225 Difference]: With dead ends: 98 [2024-11-02 21:06:43,284 INFO L226 Difference]: Without dead ends: 81 [2024-11-02 21:06:43,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-02 21:06:43,284 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 56 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:43,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 283 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 21:06:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-02 21:06:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2024-11-02 21:06:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-02 21:06:43,293 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 86 [2024-11-02 21:06:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:43,293 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-02 21:06:43,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-02 21:06:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-02 21:06:43,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:43,295 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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 21:06:43,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 21:06:43,295 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:43,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1097028377, now seen corresponding path program 2 times [2024-11-02 21:06:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [290118081] [2024-11-02 21:06:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:43,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-02 21:06:43,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-02 21:06:43,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-02 21:06:43,609 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:43,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [290118081] [2024-11-02 21:06:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [290118081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 21:06:43,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 21:06:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-02 21:06:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140544800] [2024-11-02 21:06:43,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 21:06:43,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 21:06:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 21:06:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 21:06:43,611 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:43,712 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2024-11-02 21:06:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 21:06:43,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 98 [2024-11-02 21:06:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:43,715 INFO L225 Difference]: With dead ends: 110 [2024-11-02 21:06:43,715 INFO L226 Difference]: Without dead ends: 103 [2024-11-02 21:06:43,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-02 21:06:43,716 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 30 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:43,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 308 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 21:06:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-02 21:06:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-02 21:06:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 92 states have internal predecessors, (101), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2024-11-02 21:06:43,725 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 98 [2024-11-02 21:06:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:43,725 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2024-11-02 21:06:43,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2024-11-02 21:06:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-02 21:06:43,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:43,727 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 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 21:06:43,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-02 21:06:43,728 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:43,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash 208368793, now seen corresponding path program 3 times [2024-11-02 21:06:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1917087212] [2024-11-02 21:06:43,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:43,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-02 21:06:43,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 132 proven. 37 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-02 21:06:43,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 132 proven. 37 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-02 21:06:44,097 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:44,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1917087212] [2024-11-02 21:06:44,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1917087212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 21:06:44,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 21:06:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-02 21:06:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400976999] [2024-11-02 21:06:44,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 21:06:44,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-02 21:06:44,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:44,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-02 21:06:44,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-02 21:06:44,099 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:44,548 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2024-11-02 21:06:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-02 21:06:44,549 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 126 [2024-11-02 21:06:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:44,550 INFO L225 Difference]: With dead ends: 165 [2024-11-02 21:06:44,550 INFO L226 Difference]: Without dead ends: 127 [2024-11-02 21:06:44,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2024-11-02 21:06:44,551 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 78 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:44,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 461 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 21:06:44,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-02 21:06:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-02 21:06:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 116 states have (on average 1.0775862068965518) internal successors, (125), 116 states have internal predecessors, (125), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2024-11-02 21:06:44,563 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 126 [2024-11-02 21:06:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:44,564 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2024-11-02 21:06:44,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2024-11-02 21:06:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-02 21:06:44,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:44,565 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 6, 6, 6, 6, 6, 6, 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 21:06:44,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-02 21:06:44,565 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1235520103, now seen corresponding path program 4 times [2024-11-02 21:06:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405882822] [2024-11-02 21:06:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:44,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-02 21:06:44,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 213 proven. 22 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2024-11-02 21:06:44,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 213 proven. 22 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2024-11-02 21:06:45,030 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:45,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [405882822] [2024-11-02 21:06:45,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [405882822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 21:06:45,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 21:06:45,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-02 21:06:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944306149] [2024-11-02 21:06:45,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 21:06:45,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-02 21:06:45,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-02 21:06:45,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-02 21:06:45,032 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:45,360 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2024-11-02 21:06:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-02 21:06:45,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 150 [2024-11-02 21:06:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:45,362 INFO L225 Difference]: With dead ends: 208 [2024-11-02 21:06:45,363 INFO L226 Difference]: Without dead ends: 136 [2024-11-02 21:06:45,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2024-11-02 21:06:45,364 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 87 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:45,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 409 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 21:06:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-02 21:06:45,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-02 21:06:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 125 states have (on average 1.072) internal successors, (134), 125 states have internal predecessors, (134), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2024-11-02 21:06:45,373 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 150 [2024-11-02 21:06:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:45,374 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2024-11-02 21:06:45,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2024-11-02 21:06:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-02 21:06:45,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:45,376 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 6, 6, 6, 6, 6, 6, 6, 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 21:06:45,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-02 21:06:45,376 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:45,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -656843413, now seen corresponding path program 5 times [2024-11-02 21:06:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:45,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [944866324] [2024-11-02 21:06:45,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:45,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:45,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-02 21:06:45,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 340 proven. 295 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-11-02 21:06:45,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 340 proven. 295 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-11-02 21:06:45,998 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:45,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [944866324] [2024-11-02 21:06:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [944866324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 21:06:45,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 21:06:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-02 21:06:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358328517] [2024-11-02 21:06:45,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 21:06:45,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-02 21:06:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:46,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-02 21:06:46,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-02 21:06:46,000 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:46,580 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2024-11-02 21:06:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-02 21:06:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 159 [2024-11-02 21:06:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:46,582 INFO L225 Difference]: With dead ends: 182 [2024-11-02 21:06:46,582 INFO L226 Difference]: Without dead ends: 145 [2024-11-02 21:06:46,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2024-11-02 21:06:46,583 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 65 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:46,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 542 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 21:06:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-02 21:06:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-02 21:06:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 134 states have (on average 1.0671641791044777) internal successors, (143), 134 states have internal predecessors, (143), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2024-11-02 21:06:46,595 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 159 [2024-11-02 21:06:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:46,596 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2024-11-02 21:06:46,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2024-11-02 21:06:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-02 21:06:46,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:46,598 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 6, 6, 6, 6, 6, 6, 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 21:06:46,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-02 21:06:46,598 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash -232918615, now seen corresponding path program 6 times [2024-11-02 21:06:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:46,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [202279624] [2024-11-02 21:06:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:46,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-02 21:06:46,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 128 proven. 728 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-02 21:06:46,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 128 proven. 728 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-02 21:06:47,310 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:47,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [202279624] [2024-11-02 21:06:47,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [202279624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 21:06:47,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 21:06:47,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-02 21:06:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202065618] [2024-11-02 21:06:47,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 21:06:47,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-02 21:06:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:47,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-02 21:06:47,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-02 21:06:47,312 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:47,739 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2024-11-02 21:06:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-02 21:06:47,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 168 [2024-11-02 21:06:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:47,741 INFO L225 Difference]: With dead ends: 177 [2024-11-02 21:06:47,741 INFO L226 Difference]: Without dead ends: 160 [2024-11-02 21:06:47,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2024-11-02 21:06:47,742 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:47,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 586 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 21:06:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-02 21:06:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2024-11-02 21:06:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 143 states have (on average 1.062937062937063) internal successors, (152), 143 states have internal predecessors, (152), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2024-11-02 21:06:47,755 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 168 [2024-11-02 21:06:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:47,755 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2024-11-02 21:06:47,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2024-11-02 21:06:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-02 21:06:47,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:47,757 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 6, 6, 6, 6, 6, 6, 6, 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 21:06:47,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-02 21:06:47,757 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:47,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1416794837, now seen corresponding path program 7 times [2024-11-02 21:06:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:47,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475291917] [2024-11-02 21:06:47,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:47,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 21:06:47,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-02 21:06:47,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 21:06:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 0 proven. 1086 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-11-02 21:06:48,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 21:06:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 0 proven. 1086 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-11-02 21:06:48,519 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 21:06:48,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475291917] [2024-11-02 21:06:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1475291917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 21:06:48,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 21:06:48,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-02 21:06:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239478092] [2024-11-02 21:06:48,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 21:06:48,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-02 21:06:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 21:06:48,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-02 21:06:48,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-02 21:06:48,523 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 21:06:48,718 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2024-11-02 21:06:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 21:06:48,719 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 177 [2024-11-02 21:06:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 21:06:48,720 INFO L225 Difference]: With dead ends: 174 [2024-11-02 21:06:48,720 INFO L226 Difference]: Without dead ends: 167 [2024-11-02 21:06:48,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-02 21:06:48,721 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 11 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 21:06:48,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 740 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 21:06:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-02 21:06:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2024-11-02 21:06:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 150 states have (on average 1.0666666666666667) internal successors, (160), 150 states have internal predecessors, (160), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-02 21:06:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2024-11-02 21:06:48,734 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 177 [2024-11-02 21:06:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 21:06:48,734 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2024-11-02 21:06:48,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-02 21:06:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2024-11-02 21:06:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-02 21:06:48,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 21:06:48,736 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 7, 7, 7, 7, 6, 6, 6, 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 21:06:48,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-02 21:06:48,736 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 21:06:48,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 21:06:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash 773529361, now seen corresponding path program 8 times [2024-11-02 21:06:48,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 21:06:48,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [925239743] [2024-11-02 21:06:48,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 21:06:48,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 21:06:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 21:06:55,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 21:06:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 21:06:57,146 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-02 21:06:57,147 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 21:06:57,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-02 21:06:57,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-02 21:06:57,153 INFO L407 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 21:06:57,235 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 21:06:57,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:06:57 BoogieIcfgContainer [2024-11-02 21:06:57,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 21:06:57,237 INFO L158 Benchmark]: Toolchain (without parser) took 18368.57ms. Allocated memory was 207.6MB in the beginning and 781.2MB in the end (delta: 573.6MB). Free memory was 166.7MB in the beginning and 523.2MB in the end (delta: -356.5MB). Peak memory consumption was 460.2MB. Max. memory is 8.0GB. [2024-11-02 21:06:57,237 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 207.6MB. Free memory is still 165.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-02 21:06:57,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.64ms. Allocated memory is still 207.6MB. Free memory was 166.3MB in the beginning and 152.6MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-02 21:06:57,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.91ms. Allocated memory is still 207.6MB. Free memory was 152.6MB in the beginning and 150.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-02 21:06:57,239 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 207.6MB. Free memory was 150.6MB in the beginning and 147.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-02 21:06:57,241 INFO L158 Benchmark]: RCFGBuilder took 548.12ms. Allocated memory is still 207.6MB. Free memory was 147.8MB in the beginning and 127.2MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-11-02 21:06:57,241 INFO L158 Benchmark]: TraceAbstraction took 17458.93ms. Allocated memory was 207.6MB in the beginning and 781.2MB in the end (delta: 573.6MB). Free memory was 126.5MB in the beginning and 523.2MB in the end (delta: -396.7MB). Peak memory consumption was 420.3MB. Max. memory is 8.0GB. [2024-11-02 21:06:57,242 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.13ms. Allocated memory is still 207.6MB. Free memory is still 165.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.64ms. Allocated memory is still 207.6MB. Free memory was 166.3MB in the beginning and 152.6MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.91ms. Allocated memory is still 207.6MB. Free memory was 152.6MB in the beginning and 150.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.48ms. Allocated memory is still 207.6MB. Free memory was 150.6MB in the beginning and 147.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 548.12ms. Allocated memory is still 207.6MB. Free memory was 147.8MB in the beginning and 127.2MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 17458.93ms. Allocated memory was 207.6MB in the beginning and 781.2MB in the end (delta: 573.6MB). Free memory was 126.5MB in the beginning and 523.2MB in the end (delta: -396.7MB). Peak memory consumption was 420.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=9, \result=1] [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=5, \result=1] [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=6, \result=1] [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=7, \result=1] [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=1, \result=1] [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=0, \result=1] [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=8, \result=1] [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=2, \result=1] [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={11:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={11:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=0, j=8] [L39] COND FALSE !(j < 8) VAL [d={11:0}, i=0] [L38] i++ VAL [d={11:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={11:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=1, j=8] [L39] COND FALSE !(j < 8) VAL [d={11:0}, i=1] [L38] i++ VAL [d={11:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={11:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=2, j=8] [L39] COND FALSE !(j < 8) VAL [d={11:0}, i=2] [L38] i++ VAL [d={11:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={11:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=3, j=8] [L39] COND FALSE !(j < 8) VAL [d={11:0}, i=3] [L38] i++ VAL [d={11:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={11:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=4, j=8] [L39] COND FALSE !(j < 8) VAL [d={11:0}, i=4] [L38] i++ VAL [d={11:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={11:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=5, j=8] [L39] COND FALSE !(j < 8) VAL [d={11:0}, i=5] [L38] i++ VAL [d={11:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={11:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={11:0}, i=6, j=8] [L39] COND FALSE !(j < 8) VAL [d={11:0}, i=6] [L38] i++ VAL [d={11:0}, i=7] [L38] COND FALSE !(i < 7) VAL [d={11:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; VAL [\result=1] [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 21, TraceHistogramMax: 28, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 5823 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4474 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1077 IncrementalHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 1349 mSDtfsCounter, 1077 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3244 GetRequests, 3073 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=20, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 8.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1793 NumberOfCodeBlocks, 1793 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3178 ConstructedInterpolants, 0 QuantifiedInterpolants, 5160 SizeOfPredicates, 42 NumberOfNonLiveVariables, 3530 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 40 InterpolantComputations, 26 PerfectInterpolantSequences, 5312/9722 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-02 21:06:57,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...