/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 04:10:51,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 04:10:51,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 04:10:51,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 04:10:51,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 04:10:51,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 04:10:51,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 04:10:51,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 04:10:51,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 04:10:51,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 04:10:51,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 04:10:51,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 04:10:51,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 04:10:51,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 04:10:51,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 04:10:51,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 04:10:51,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 04:10:51,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 04:10:51,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 04:10:51,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 04:10:51,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 04:10:51,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 04:10:51,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 04:10:51,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 04:10:51,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 04:10:51,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 04:10:51,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 04:10:51,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 04:10:51,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 04:10:51,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 04:10:51,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 04:10:51,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 04:10:51,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 04:10:51,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 04:10:51,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 04:10:51,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 04:10:51,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 04:10:51,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 04:10:51,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 04:10:51,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 04:10:51,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 04:10:51,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 04:10:51,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 04:10:51,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 04:10:51,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 04:10:51,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 04:10:51,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 04:10:51,557 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 04:10:51,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 04:10:51,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 04:10:51,557 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 04:10:51,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 04:10:51,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 04:10:51,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 04:10:51,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 04:10:51,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 04:10:51,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 04:10:51,559 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 04:10:51,559 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 04:10:51,559 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 04:10:51,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 04:10:51,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 04:10:51,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 04:10:51,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 04:10:51,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 04:10:51,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:10:51,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 04:10:51,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 04:10:51,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 04:10:51,560 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 04:10:51,560 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 04:10:51,560 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 04:10:51,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 04:10:51,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 04:10:51,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 04:10:51,561 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 04:10:51,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 04:10:51,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 04:10:51,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 04:10:51,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 04:10:51,784 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 04:10:51,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_7.cil.c [2022-01-10 04:10:51,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54410944/cf463108ccd34ab6a042a42c4605cc3e/FLAG622d0712a [2022-01-10 04:10:52,135 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 04:10:52,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_7.cil.c [2022-01-10 04:10:52,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54410944/cf463108ccd34ab6a042a42c4605cc3e/FLAG622d0712a [2022-01-10 04:10:52,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54410944/cf463108ccd34ab6a042a42c4605cc3e [2022-01-10 04:10:52,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 04:10:52,559 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 04:10:52,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 04:10:52,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 04:10:52,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 04:10:52,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:52,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461c1c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52, skipping insertion in model container [2022-01-10 04:10:52,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:52,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 04:10:52,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 04:10:52,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_7.cil.c[44376,44389] [2022-01-10 04:10:52,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:10:52,884 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 04:10:52,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_7.cil.c[44376,44389] [2022-01-10 04:10:52,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:10:52,953 INFO L208 MainTranslator]: Completed translation [2022-01-10 04:10:52,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52 WrapperNode [2022-01-10 04:10:52,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 04:10:52,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 04:10:52,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 04:10:52,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 04:10:52,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:52,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:52,989 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 510 [2022-01-10 04:10:52,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 04:10:52,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 04:10:52,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 04:10:52,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 04:10:52,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:52,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:52,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:52,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:53,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:53,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:53,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:53,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 04:10:53,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 04:10:53,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 04:10:53,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 04:10:53,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (1/1) ... [2022-01-10 04:10:53,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:10:53,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 04:10:53,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 04:10:53,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 04:10:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 04:10:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 04:10:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 04:10:53,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 04:10:53,184 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 04:10:53,185 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 04:10:53,207 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:10:53,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 04:10:53,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 04:10:53,569 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 04:10:53,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 04:10:53,584 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 04:10:53,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:10:53 BoogieIcfgContainer [2022-01-10 04:10:53,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 04:10:53,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 04:10:53,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 04:10:53,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 04:10:53,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:10:52" (1/3) ... [2022-01-10 04:10:53,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4165f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:10:53, skipping insertion in model container [2022-01-10 04:10:53,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:52" (2/3) ... [2022-01-10 04:10:53,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4165f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:10:53, skipping insertion in model container [2022-01-10 04:10:53,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:10:53" (3/3) ... [2022-01-10 04:10:53,591 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2022-01-10 04:10:53,595 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 04:10:53,595 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 04:10:53,646 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 04:10:53,665 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 04:10:53,666 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 04:10:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 145 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 04:10:53,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:53,688 INFO L514 BasicCegarLoop]: 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] [2022-01-10 04:10:53,689 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1801233509, now seen corresponding path program 1 times [2022-01-10 04:10:53,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:53,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423662920] [2022-01-10 04:10:53,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:53,701 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:53,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:53,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:53,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 04:10:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:53,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 04:10:53,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:54,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:54,062 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:54,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423662920] [2022-01-10 04:10:54,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423662920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:54,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:54,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:54,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714725221] [2022-01-10 04:10:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:54,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:54,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:54,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:54,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:54,128 INFO L87 Difference]: Start difference. First operand has 146 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 145 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:54,314 INFO L93 Difference]: Finished difference Result 312 states and 534 transitions. [2022-01-10 04:10:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:54,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-10 04:10:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:54,323 INFO L225 Difference]: With dead ends: 312 [2022-01-10 04:10:54,323 INFO L226 Difference]: Without dead ends: 154 [2022-01-10 04:10:54,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:54,328 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 31 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:54,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 386 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-01-10 04:10:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2022-01-10 04:10:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 150 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2022-01-10 04:10:54,368 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 33 [2022-01-10 04:10:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:54,368 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2022-01-10 04:10:54,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2022-01-10 04:10:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 04:10:54,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:54,370 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 04:10:54,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 04:10:54,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:54,584 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:54,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:54,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1779167419, now seen corresponding path program 1 times [2022-01-10 04:10:54,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:54,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599141953] [2022-01-10 04:10:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:54,598 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:54,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:54,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:54,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 04:10:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:54,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:54,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:54,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:54,738 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:54,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599141953] [2022-01-10 04:10:54,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599141953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:54,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:54,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:54,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385219020] [2022-01-10 04:10:54,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:54,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:54,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:54,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:54,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:54,741 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:54,853 INFO L93 Difference]: Finished difference Result 319 states and 490 transitions. [2022-01-10 04:10:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:54,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-01-10 04:10:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:54,855 INFO L225 Difference]: With dead ends: 319 [2022-01-10 04:10:54,855 INFO L226 Difference]: Without dead ends: 176 [2022-01-10 04:10:54,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:54,857 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 14 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:54,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 312 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-01-10 04:10:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2022-01-10 04:10:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.4912280701754386) internal successors, (255), 171 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2022-01-10 04:10:54,872 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 49 [2022-01-10 04:10:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:54,873 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2022-01-10 04:10:54,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2022-01-10 04:10:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 04:10:54,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:54,874 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 04:10:54,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:55,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:55,076 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash 846918541, now seen corresponding path program 1 times [2022-01-10 04:10:55,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:55,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326450103] [2022-01-10 04:10:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:55,077 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:55,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:55,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:55,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 04:10:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:55,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:55,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 04:10:55,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:55,254 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:55,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326450103] [2022-01-10 04:10:55,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326450103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:55,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:55,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:55,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452213172] [2022-01-10 04:10:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:55,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:55,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:55,257 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:55,395 INFO L93 Difference]: Finished difference Result 384 states and 585 transitions. [2022-01-10 04:10:55,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:55,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-01-10 04:10:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:55,399 INFO L225 Difference]: With dead ends: 384 [2022-01-10 04:10:55,399 INFO L226 Difference]: Without dead ends: 220 [2022-01-10 04:10:55,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:55,404 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 32 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:55,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 309 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-01-10 04:10:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 214. [2022-01-10 04:10:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.4178403755868545) internal successors, (302), 213 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 302 transitions. [2022-01-10 04:10:55,421 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 302 transitions. Word has length 70 [2022-01-10 04:10:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:55,422 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 302 transitions. [2022-01-10 04:10:55,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 302 transitions. [2022-01-10 04:10:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 04:10:55,424 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:55,424 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 04:10:55,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:55,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:55,625 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1548518415, now seen corresponding path program 1 times [2022-01-10 04:10:55,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:55,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66226415] [2022-01-10 04:10:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:55,626 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:55,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:55,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:55,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 04:10:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:55,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:55,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 04:10:55,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:55,812 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:55,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66226415] [2022-01-10 04:10:55,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66226415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:55,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:55,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:55,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444345927] [2022-01-10 04:10:55,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:55,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:55,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:55,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:55,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:55,814 INFO L87 Difference]: Start difference. First operand 214 states and 302 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:55,936 INFO L93 Difference]: Finished difference Result 448 states and 641 transitions. [2022-01-10 04:10:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:55,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-01-10 04:10:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:55,939 INFO L225 Difference]: With dead ends: 448 [2022-01-10 04:10:55,939 INFO L226 Difference]: Without dead ends: 242 [2022-01-10 04:10:55,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:55,940 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 16 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:55,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 328 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-01-10 04:10:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 237. [2022-01-10 04:10:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.3983050847457628) internal successors, (330), 236 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2022-01-10 04:10:55,950 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 70 [2022-01-10 04:10:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:55,951 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2022-01-10 04:10:55,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2022-01-10 04:10:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 04:10:55,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:55,954 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:55,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:56,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:56,162 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:56,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:56,163 INFO L85 PathProgramCache]: Analyzing trace with hash -798419225, now seen corresponding path program 1 times [2022-01-10 04:10:56,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:56,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449420207] [2022-01-10 04:10:56,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:56,164 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:56,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:56,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:56,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 04:10:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:56,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:56,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 04:10:56,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:56,342 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:56,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449420207] [2022-01-10 04:10:56,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449420207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:56,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:56,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:56,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072058090] [2022-01-10 04:10:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:56,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:56,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:56,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:56,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:56,349 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:56,459 INFO L93 Difference]: Finished difference Result 505 states and 717 transitions. [2022-01-10 04:10:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:56,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-01-10 04:10:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:56,461 INFO L225 Difference]: With dead ends: 505 [2022-01-10 04:10:56,462 INFO L226 Difference]: Without dead ends: 276 [2022-01-10 04:10:56,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:56,462 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 32 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:56,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 327 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-01-10 04:10:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 262. [2022-01-10 04:10:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 261 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 360 transitions. [2022-01-10 04:10:56,470 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 360 transitions. Word has length 91 [2022-01-10 04:10:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:56,472 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 360 transitions. [2022-01-10 04:10:56,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 360 transitions. [2022-01-10 04:10:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 04:10:56,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:56,476 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:56,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:56,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:56,684 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash -707468929, now seen corresponding path program 1 times [2022-01-10 04:10:56,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:56,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257448041] [2022-01-10 04:10:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:56,685 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:56,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:56,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:56,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 04:10:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:56,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:56,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 04:10:56,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:56,865 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:56,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257448041] [2022-01-10 04:10:56,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257448041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:56,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:56,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:56,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474238589] [2022-01-10 04:10:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:56,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:56,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:56,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:56,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:56,867 INFO L87 Difference]: Start difference. First operand 262 states and 360 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:57,025 INFO L93 Difference]: Finished difference Result 561 states and 792 transitions. [2022-01-10 04:10:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:57,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-10 04:10:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:57,027 INFO L225 Difference]: With dead ends: 561 [2022-01-10 04:10:57,027 INFO L226 Difference]: Without dead ends: 307 [2022-01-10 04:10:57,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:57,030 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 28 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:57,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 324 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-01-10 04:10:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 304. [2022-01-10 04:10:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.3432343234323432) internal successors, (407), 303 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 407 transitions. [2022-01-10 04:10:57,036 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 407 transitions. Word has length 110 [2022-01-10 04:10:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:57,036 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 407 transitions. [2022-01-10 04:10:57,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 407 transitions. [2022-01-10 04:10:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 04:10:57,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:57,039 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:57,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:57,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:57,246 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1900430797, now seen corresponding path program 1 times [2022-01-10 04:10:57,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:57,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928076753] [2022-01-10 04:10:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:57,247 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:57,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:57,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:57,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 04:10:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:57,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:57,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-10 04:10:57,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:57,433 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:57,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928076753] [2022-01-10 04:10:57,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928076753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:57,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:57,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:57,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583125862] [2022-01-10 04:10:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:57,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:57,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:57,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:57,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:57,434 INFO L87 Difference]: Start difference. First operand 304 states and 407 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:57,449 INFO L93 Difference]: Finished difference Result 889 states and 1184 transitions. [2022-01-10 04:10:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:57,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-01-10 04:10:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:57,451 INFO L225 Difference]: With dead ends: 889 [2022-01-10 04:10:57,451 INFO L226 Difference]: Without dead ends: 593 [2022-01-10 04:10:57,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:57,452 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 178 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 581 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 [2022-01-10 04:10:57,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 581 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-01-10 04:10:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 305. [2022-01-10 04:10:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.3421052631578947) internal successors, (408), 304 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 408 transitions. [2022-01-10 04:10:57,458 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 408 transitions. Word has length 117 [2022-01-10 04:10:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:57,458 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 408 transitions. [2022-01-10 04:10:57,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 408 transitions. [2022-01-10 04:10:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 04:10:57,459 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:57,459 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:57,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:57,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:57,666 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:57,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash 150553201, now seen corresponding path program 1 times [2022-01-10 04:10:57,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:57,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363065083] [2022-01-10 04:10:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:57,667 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:57,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:57,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 04:10:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:57,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:57,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-10 04:10:57,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:57,882 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:57,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363065083] [2022-01-10 04:10:57,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363065083] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:57,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:57,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:57,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369834107] [2022-01-10 04:10:57,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:57,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:57,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:57,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:57,884 INFO L87 Difference]: Start difference. First operand 305 states and 408 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:57,911 INFO L93 Difference]: Finished difference Result 889 states and 1182 transitions. [2022-01-10 04:10:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:57,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-01-10 04:10:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:57,913 INFO L225 Difference]: With dead ends: 889 [2022-01-10 04:10:57,913 INFO L226 Difference]: Without dead ends: 592 [2022-01-10 04:10:57,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:57,913 INFO L933 BasicCegarLoop]: 381 mSDtfsCounter, 186 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:57,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 572 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-01-10 04:10:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 305. [2022-01-10 04:10:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.3388157894736843) internal successors, (407), 304 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 407 transitions. [2022-01-10 04:10:57,920 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 407 transitions. Word has length 117 [2022-01-10 04:10:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:57,920 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 407 transitions. [2022-01-10 04:10:57,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 407 transitions. [2022-01-10 04:10:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 04:10:57,921 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:57,921 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:57,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 04:10:58,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:58,127 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1784226940, now seen corresponding path program 1 times [2022-01-10 04:10:58,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:58,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108785020] [2022-01-10 04:10:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:58,128 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:58,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:58,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:58,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 04:10:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:58,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:58,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-01-10 04:10:58,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:58,320 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:58,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108785020] [2022-01-10 04:10:58,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108785020] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:58,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:58,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:58,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829504698] [2022-01-10 04:10:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:58,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:58,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:58,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:58,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:58,321 INFO L87 Difference]: Start difference. First operand 305 states and 407 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:58,354 INFO L93 Difference]: Finished difference Result 850 states and 1142 transitions. [2022-01-10 04:10:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:58,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-01-10 04:10:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:58,356 INFO L225 Difference]: With dead ends: 850 [2022-01-10 04:10:58,356 INFO L226 Difference]: Without dead ends: 553 [2022-01-10 04:10:58,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:58,357 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 144 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:58,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 422 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-01-10 04:10:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2022-01-10 04:10:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.338768115942029) internal successors, (739), 552 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 739 transitions. [2022-01-10 04:10:58,367 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 739 transitions. Word has length 118 [2022-01-10 04:10:58,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:58,367 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 739 transitions. [2022-01-10 04:10:58,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 739 transitions. [2022-01-10 04:10:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 04:10:58,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:58,368 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:58,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:58,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:58,578 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash 726388862, now seen corresponding path program 1 times [2022-01-10 04:10:58,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:58,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825809302] [2022-01-10 04:10:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:58,579 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:58,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:58,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 04:10:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:58,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:58,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-01-10 04:10:58,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:58,837 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:58,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825809302] [2022-01-10 04:10:58,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825809302] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:58,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:58,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:58,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139406427] [2022-01-10 04:10:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:58,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:58,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:58,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:58,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:58,838 INFO L87 Difference]: Start difference. First operand 553 states and 739 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:58,882 INFO L93 Difference]: Finished difference Result 1122 states and 1496 transitions. [2022-01-10 04:10:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:58,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-01-10 04:10:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:58,884 INFO L225 Difference]: With dead ends: 1122 [2022-01-10 04:10:58,884 INFO L226 Difference]: Without dead ends: 577 [2022-01-10 04:10:58,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:58,885 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 10 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:58,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 398 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-01-10 04:10:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2022-01-10 04:10:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.3333333333333333) internal successors, (768), 576 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 768 transitions. [2022-01-10 04:10:58,896 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 768 transitions. Word has length 118 [2022-01-10 04:10:58,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:58,896 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 768 transitions. [2022-01-10 04:10:58,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 768 transitions. [2022-01-10 04:10:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 04:10:58,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:58,898 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:58,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:59,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:59,104 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1671081668, now seen corresponding path program 1 times [2022-01-10 04:10:59,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:59,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746203669] [2022-01-10 04:10:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:59,105 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:59,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:59,120 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:59,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 04:10:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:59,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:59,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-01-10 04:10:59,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:59,319 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:59,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746203669] [2022-01-10 04:10:59,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746203669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:59,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:59,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:59,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154980060] [2022-01-10 04:10:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:59,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:59,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:59,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:59,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:59,320 INFO L87 Difference]: Start difference. First operand 577 states and 768 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:59,342 INFO L93 Difference]: Finished difference Result 1159 states and 1538 transitions. [2022-01-10 04:10:59,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:59,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-01-10 04:10:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:59,344 INFO L225 Difference]: With dead ends: 1159 [2022-01-10 04:10:59,344 INFO L226 Difference]: Without dead ends: 590 [2022-01-10 04:10:59,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:59,345 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 6 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:59,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 378 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-01-10 04:10:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2022-01-10 04:10:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.3259762308998302) internal successors, (781), 589 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 781 transitions. [2022-01-10 04:10:59,354 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 781 transitions. Word has length 118 [2022-01-10 04:10:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:59,354 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 781 transitions. [2022-01-10 04:10:59,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 781 transitions. [2022-01-10 04:10:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 04:10:59,355 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:59,355 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:59,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:59,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:59,562 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash 855711090, now seen corresponding path program 1 times [2022-01-10 04:10:59,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:59,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939878211] [2022-01-10 04:10:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:59,563 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:59,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:59,564 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:59,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 04:10:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:59,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:59,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-10 04:10:59,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:59,763 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:59,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939878211] [2022-01-10 04:10:59,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939878211] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:59,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:59,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:59,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250815527] [2022-01-10 04:10:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:59,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:59,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:59,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:59,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:59,764 INFO L87 Difference]: Start difference. First operand 590 states and 781 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:59,801 INFO L93 Difference]: Finished difference Result 1410 states and 1882 transitions. [2022-01-10 04:10:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:59,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-01-10 04:10:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:59,804 INFO L225 Difference]: With dead ends: 1410 [2022-01-10 04:10:59,804 INFO L226 Difference]: Without dead ends: 841 [2022-01-10 04:10:59,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:59,805 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 150 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:59,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 555 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-01-10 04:10:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2022-01-10 04:10:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.3285714285714285) internal successors, (1116), 840 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1116 transitions. [2022-01-10 04:10:59,817 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1116 transitions. Word has length 120 [2022-01-10 04:10:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:59,817 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 1116 transitions. [2022-01-10 04:10:59,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1116 transitions. [2022-01-10 04:10:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 04:10:59,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:59,819 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:59,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:00,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:00,026 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:00,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:00,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1130470704, now seen corresponding path program 1 times [2022-01-10 04:11:00,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:00,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728023212] [2022-01-10 04:11:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:00,027 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:00,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:00,028 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:00,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 04:11:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:00,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:00,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 04:11:00,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:00,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:00,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728023212] [2022-01-10 04:11:00,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728023212] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:00,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:00,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:00,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722715009] [2022-01-10 04:11:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:00,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:00,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:00,241 INFO L87 Difference]: Start difference. First operand 841 states and 1116 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:00,280 INFO L93 Difference]: Finished difference Result 1955 states and 2600 transitions. [2022-01-10 04:11:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-01-10 04:11:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:00,283 INFO L225 Difference]: With dead ends: 1955 [2022-01-10 04:11:00,283 INFO L226 Difference]: Without dead ends: 1135 [2022-01-10 04:11:00,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:00,284 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 154 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:00,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 557 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:11:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-01-10 04:11:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2022-01-10 04:11:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 1.3218694885361553) internal successors, (1499), 1134 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1499 transitions. [2022-01-10 04:11:00,299 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1499 transitions. Word has length 120 [2022-01-10 04:11:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:00,300 INFO L470 AbstractCegarLoop]: Abstraction has 1135 states and 1499 transitions. [2022-01-10 04:11:00,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1499 transitions. [2022-01-10 04:11:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-10 04:11:00,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:00,302 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:00,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:00,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:00,508 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1424861235, now seen corresponding path program 1 times [2022-01-10 04:11:00,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:00,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942207049] [2022-01-10 04:11:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:00,509 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:00,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:00,510 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:00,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 04:11:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:00,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:00,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 04:11:00,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:00,769 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:00,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942207049] [2022-01-10 04:11:00,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942207049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:00,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:00,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:00,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530416533] [2022-01-10 04:11:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:00,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:00,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:00,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:00,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:00,770 INFO L87 Difference]: Start difference. First operand 1135 states and 1499 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:00,797 INFO L93 Difference]: Finished difference Result 2295 states and 3025 transitions. [2022-01-10 04:11:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:00,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-01-10 04:11:00,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:00,800 INFO L225 Difference]: With dead ends: 2295 [2022-01-10 04:11:00,800 INFO L226 Difference]: Without dead ends: 1181 [2022-01-10 04:11:00,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:00,801 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 10 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:00,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 432 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:11:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-01-10 04:11:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2022-01-10 04:11:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1180 states have (on average 1.3135593220338984) internal successors, (1550), 1180 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1550 transitions. [2022-01-10 04:11:00,815 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1550 transitions. Word has length 152 [2022-01-10 04:11:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:00,815 INFO L470 AbstractCegarLoop]: Abstraction has 1181 states and 1550 transitions. [2022-01-10 04:11:00,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1550 transitions. [2022-01-10 04:11:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-10 04:11:00,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:00,817 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:00,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:01,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:01,024 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1497247793, now seen corresponding path program 1 times [2022-01-10 04:11:01,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:01,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954386796] [2022-01-10 04:11:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:01,025 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:01,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:01,026 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:01,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 04:11:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:01,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:01,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-10 04:11:01,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:01,263 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:01,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954386796] [2022-01-10 04:11:01,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954386796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:01,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:01,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:01,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515436224] [2022-01-10 04:11:01,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:01,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:01,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:01,264 INFO L87 Difference]: Start difference. First operand 1181 states and 1550 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:01,367 INFO L93 Difference]: Finished difference Result 2465 states and 3307 transitions. [2022-01-10 04:11:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:01,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-01-10 04:11:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:01,370 INFO L225 Difference]: With dead ends: 2465 [2022-01-10 04:11:01,370 INFO L226 Difference]: Without dead ends: 1305 [2022-01-10 04:11:01,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:01,372 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 17 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:01,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 320 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:11:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2022-01-10 04:11:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1305. [2022-01-10 04:11:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1304 states have (on average 1.299079754601227) internal successors, (1694), 1304 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1694 transitions. [2022-01-10 04:11:01,389 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1694 transitions. Word has length 152 [2022-01-10 04:11:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:01,390 INFO L470 AbstractCegarLoop]: Abstraction has 1305 states and 1694 transitions. [2022-01-10 04:11:01,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1694 transitions. [2022-01-10 04:11:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-01-10 04:11:01,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:01,392 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:01,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-01-10 04:11:01,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:01,599 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1525056458, now seen corresponding path program 1 times [2022-01-10 04:11:01,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:01,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85221852] [2022-01-10 04:11:01,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:01,599 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:01,601 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:01,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 04:11:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:01,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 04:11:01,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 150 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-10 04:11:01,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:11:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 150 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-10 04:11:02,098 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:02,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85221852] [2022-01-10 04:11:02,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85221852] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:11:02,098 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:11:02,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 04:11:02,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914231213] [2022-01-10 04:11:02,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:11:02,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:11:02,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:11:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:11:02,100 INFO L87 Difference]: Start difference. First operand 1305 states and 1694 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:02,661 INFO L93 Difference]: Finished difference Result 5647 states and 7773 transitions. [2022-01-10 04:11:02,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 04:11:02,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2022-01-10 04:11:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:02,672 INFO L225 Difference]: With dead ends: 5647 [2022-01-10 04:11:02,672 INFO L226 Difference]: Without dead ends: 4363 [2022-01-10 04:11:02,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-10 04:11:02,674 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 591 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:02,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 1085 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 04:11:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2022-01-10 04:11:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 3508. [2022-01-10 04:11:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3508 states, 3507 states have (on average 1.3555745651554034) internal successors, (4754), 3507 states have internal predecessors, (4754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3508 states and 4754 transitions. [2022-01-10 04:11:02,730 INFO L78 Accepts]: Start accepts. Automaton has 3508 states and 4754 transitions. Word has length 180 [2022-01-10 04:11:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:02,731 INFO L470 AbstractCegarLoop]: Abstraction has 3508 states and 4754 transitions. [2022-01-10 04:11:02,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3508 states and 4754 transitions. [2022-01-10 04:11:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-01-10 04:11:02,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:02,734 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:02,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-01-10 04:11:02,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:02,941 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:02,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash -805705897, now seen corresponding path program 1 times [2022-01-10 04:11:02,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:02,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25924087] [2022-01-10 04:11:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:02,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:02,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:02,952 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:02,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 04:11:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:03,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:03,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-10 04:11:03,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:03,226 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:03,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25924087] [2022-01-10 04:11:03,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25924087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:03,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:03,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:03,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968293043] [2022-01-10 04:11:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:03,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:03,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:03,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:03,227 INFO L87 Difference]: Start difference. First operand 3508 states and 4754 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:03,276 INFO L93 Difference]: Finished difference Result 8989 states and 12216 transitions. [2022-01-10 04:11:03,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:03,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2022-01-10 04:11:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:03,289 INFO L225 Difference]: With dead ends: 8989 [2022-01-10 04:11:03,289 INFO L226 Difference]: Without dead ends: 5526 [2022-01-10 04:11:03,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:03,292 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 141 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:03,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 551 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:11:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2022-01-10 04:11:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5171. [2022-01-10 04:11:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 5170 states have (on average 1.3653771760154738) internal successors, (7059), 5170 states have internal predecessors, (7059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 7059 transitions. [2022-01-10 04:11:03,413 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 7059 transitions. Word has length 181 [2022-01-10 04:11:03,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:03,413 INFO L470 AbstractCegarLoop]: Abstraction has 5171 states and 7059 transitions. [2022-01-10 04:11:03,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 7059 transitions. [2022-01-10 04:11:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-01-10 04:11:03,419 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:03,419 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:03,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:03,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:03,628 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:03,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:03,629 INFO L85 PathProgramCache]: Analyzing trace with hash -67040907, now seen corresponding path program 1 times [2022-01-10 04:11:03,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:03,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223169894] [2022-01-10 04:11:03,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:03,630 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:03,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:03,631 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:03,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 04:11:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:03,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:03,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-10 04:11:03,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:03,947 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:03,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223169894] [2022-01-10 04:11:03,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223169894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:03,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:03,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:03,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418499409] [2022-01-10 04:11:03,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:03,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:03,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:03,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:03,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:03,949 INFO L87 Difference]: Start difference. First operand 5171 states and 7059 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:04,028 INFO L93 Difference]: Finished difference Result 9877 states and 13418 transitions. [2022-01-10 04:11:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:04,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2022-01-10 04:11:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:04,043 INFO L225 Difference]: With dead ends: 9877 [2022-01-10 04:11:04,043 INFO L226 Difference]: Without dead ends: 6049 [2022-01-10 04:11:04,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:04,048 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 138 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:04,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 555 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:11:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2022-01-10 04:11:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 6049. [2022-01-10 04:11:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6049 states, 6048 states have (on average 1.3642526455026456) internal successors, (8251), 6048 states have internal predecessors, (8251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6049 states to 6049 states and 8251 transitions. [2022-01-10 04:11:04,148 INFO L78 Accepts]: Start accepts. Automaton has 6049 states and 8251 transitions. Word has length 187 [2022-01-10 04:11:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:04,148 INFO L470 AbstractCegarLoop]: Abstraction has 6049 states and 8251 transitions. [2022-01-10 04:11:04,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6049 states and 8251 transitions. [2022-01-10 04:11:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-10 04:11:04,156 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:04,156 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:04,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:04,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:04,363 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1885394549, now seen corresponding path program 1 times [2022-01-10 04:11:04,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:04,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119342437] [2022-01-10 04:11:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:04,364 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:04,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:04,365 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:04,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 04:11:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:04,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:04,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-01-10 04:11:04,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:04,681 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119342437] [2022-01-10 04:11:04,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119342437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:04,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:04,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:04,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786652018] [2022-01-10 04:11:04,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:04,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:04,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:04,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:04,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:04,683 INFO L87 Difference]: Start difference. First operand 6049 states and 8251 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:04,929 INFO L93 Difference]: Finished difference Result 12373 states and 17012 transitions. [2022-01-10 04:11:04,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:04,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2022-01-10 04:11:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:04,941 INFO L225 Difference]: With dead ends: 12373 [2022-01-10 04:11:04,941 INFO L226 Difference]: Without dead ends: 6369 [2022-01-10 04:11:04,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:04,965 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 22 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:04,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 327 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:11:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2022-01-10 04:11:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 6211. [2022-01-10 04:11:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6211 states, 6210 states have (on average 1.3161030595813203) internal successors, (8173), 6210 states have internal predecessors, (8173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 8173 transitions. [2022-01-10 04:11:05,120 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 8173 transitions. Word has length 233 [2022-01-10 04:11:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:05,120 INFO L470 AbstractCegarLoop]: Abstraction has 6211 states and 8173 transitions. [2022-01-10 04:11:05,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 8173 transitions. [2022-01-10 04:11:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-01-10 04:11:05,128 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:05,129 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:05,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:05,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:05,335 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:05,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash -78680508, now seen corresponding path program 1 times [2022-01-10 04:11:05,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:05,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822499616] [2022-01-10 04:11:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:05,336 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:05,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:05,337 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:05,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 04:11:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:05,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:05,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2022-01-10 04:11:05,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:05,691 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:05,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822499616] [2022-01-10 04:11:05,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822499616] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:05,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:05,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:05,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627234110] [2022-01-10 04:11:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:05,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:05,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:05,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:05,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:05,692 INFO L87 Difference]: Start difference. First operand 6211 states and 8173 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:05,821 INFO L93 Difference]: Finished difference Result 11671 states and 15488 transitions. [2022-01-10 04:11:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2022-01-10 04:11:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:05,829 INFO L225 Difference]: With dead ends: 11671 [2022-01-10 04:11:05,829 INFO L226 Difference]: Without dead ends: 5505 [2022-01-10 04:11:05,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:05,834 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 11 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:05,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 325 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:11:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5505 states. [2022-01-10 04:11:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5505 to 4629. [2022-01-10 04:11:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 4628 states have (on average 1.2808988764044944) internal successors, (5928), 4628 states have internal predecessors, (5928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 5928 transitions. [2022-01-10 04:11:05,895 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 5928 transitions. Word has length 256 [2022-01-10 04:11:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:05,895 INFO L470 AbstractCegarLoop]: Abstraction has 4629 states and 5928 transitions. [2022-01-10 04:11:05,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 5928 transitions. [2022-01-10 04:11:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-01-10 04:11:05,901 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:05,901 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:05,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:06,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:06,108 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:06,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash 459408578, now seen corresponding path program 1 times [2022-01-10 04:11:06,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:06,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172891997] [2022-01-10 04:11:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:06,109 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:06,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:06,111 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:06,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-01-10 04:11:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:06,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 04:11:06,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 594 proven. 26 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-01-10 04:11:06,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:11:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 594 proven. 26 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-01-10 04:11:06,858 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:06,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172891997] [2022-01-10 04:11:06,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172891997] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:11:06,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:11:06,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-01-10 04:11:06,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955052514] [2022-01-10 04:11:06,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:11:06,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 04:11:06,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:06,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 04:11:06,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:11:06,859 INFO L87 Difference]: Start difference. First operand 4629 states and 5928 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:07,086 INFO L93 Difference]: Finished difference Result 13580 states and 17518 transitions. [2022-01-10 04:11:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 04:11:07,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2022-01-10 04:11:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:07,097 INFO L225 Difference]: With dead ends: 13580 [2022-01-10 04:11:07,097 INFO L226 Difference]: Without dead ends: 8972 [2022-01-10 04:11:07,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 04:11:07,103 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 183 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:07,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 716 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 04:11:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8972 states. [2022-01-10 04:11:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8972 to 6294. [2022-01-10 04:11:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6294 states, 6293 states have (on average 1.293500715080248) internal successors, (8140), 6293 states have internal predecessors, (8140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6294 states to 6294 states and 8140 transitions. [2022-01-10 04:11:07,199 INFO L78 Accepts]: Start accepts. Automaton has 6294 states and 8140 transitions. Word has length 290 [2022-01-10 04:11:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:07,199 INFO L470 AbstractCegarLoop]: Abstraction has 6294 states and 8140 transitions. [2022-01-10 04:11:07,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6294 states and 8140 transitions. [2022-01-10 04:11:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2022-01-10 04:11:07,206 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:07,206 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:07,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:07,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:07,414 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:07,414 INFO L85 PathProgramCache]: Analyzing trace with hash -330038004, now seen corresponding path program 1 times [2022-01-10 04:11:07,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:07,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650687574] [2022-01-10 04:11:07,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:07,414 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:07,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:07,415 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:07,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-01-10 04:11:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:07,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:07,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2022-01-10 04:11:07,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:07,834 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:07,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650687574] [2022-01-10 04:11:07,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650687574] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:07,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:07,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:07,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579813630] [2022-01-10 04:11:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:07,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:07,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:07,835 INFO L87 Difference]: Start difference. First operand 6294 states and 8140 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:07,964 INFO L93 Difference]: Finished difference Result 13099 states and 17189 transitions. [2022-01-10 04:11:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:07,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2022-01-10 04:11:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:07,976 INFO L225 Difference]: With dead ends: 13099 [2022-01-10 04:11:07,976 INFO L226 Difference]: Without dead ends: 6826 [2022-01-10 04:11:07,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:07,983 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 13 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:07,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 329 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:11:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6826 states. [2022-01-10 04:11:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6826 to 6494. [2022-01-10 04:11:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6494 states, 6493 states have (on average 1.2921607885415063) internal successors, (8390), 6493 states have internal predecessors, (8390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 8390 transitions. [2022-01-10 04:11:08,070 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 8390 transitions. Word has length 320 [2022-01-10 04:11:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:08,070 INFO L470 AbstractCegarLoop]: Abstraction has 6494 states and 8390 transitions. [2022-01-10 04:11:08,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 8390 transitions. [2022-01-10 04:11:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-01-10 04:11:08,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:08,077 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:08,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:08,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:08,284 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:08,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash -468927488, now seen corresponding path program 1 times [2022-01-10 04:11:08,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:08,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794219711] [2022-01-10 04:11:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:08,286 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:08,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:08,290 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:08,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-01-10 04:11:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:08,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:08,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2022-01-10 04:11:08,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:08,679 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:08,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794219711] [2022-01-10 04:11:08,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794219711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:08,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:08,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:08,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966413129] [2022-01-10 04:11:08,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:08,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:08,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:08,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:08,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:08,680 INFO L87 Difference]: Start difference. First operand 6494 states and 8390 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:08,842 INFO L93 Difference]: Finished difference Result 13867 states and 18380 transitions. [2022-01-10 04:11:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:08,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2022-01-10 04:11:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:08,855 INFO L225 Difference]: With dead ends: 13867 [2022-01-10 04:11:08,855 INFO L226 Difference]: Without dead ends: 7394 [2022-01-10 04:11:08,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:08,862 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 11 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:08,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 325 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:11:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7394 states. [2022-01-10 04:11:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7394 to 7344. [2022-01-10 04:11:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7344 states, 7343 states have (on average 1.2753642925234918) internal successors, (9365), 7343 states have internal predecessors, (9365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7344 states to 7344 states and 9365 transitions. [2022-01-10 04:11:09,044 INFO L78 Accepts]: Start accepts. Automaton has 7344 states and 9365 transitions. Word has length 321 [2022-01-10 04:11:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:09,044 INFO L470 AbstractCegarLoop]: Abstraction has 7344 states and 9365 transitions. [2022-01-10 04:11:09,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 7344 states and 9365 transitions. [2022-01-10 04:11:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-01-10 04:11:09,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:09,051 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:09,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:09,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:09,257 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1878786478, now seen corresponding path program 1 times [2022-01-10 04:11:09,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:09,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397241237] [2022-01-10 04:11:09,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:09,258 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:09,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:09,260 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:09,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-01-10 04:11:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:09,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:09,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2022-01-10 04:11:09,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:09,623 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:09,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397241237] [2022-01-10 04:11:09,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397241237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:09,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:09,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:09,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637084293] [2022-01-10 04:11:09,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:09,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:09,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:09,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:09,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:09,624 INFO L87 Difference]: Start difference. First operand 7344 states and 9365 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:09,770 INFO L93 Difference]: Finished difference Result 12425 states and 16321 transitions. [2022-01-10 04:11:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:09,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2022-01-10 04:11:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:09,775 INFO L225 Difference]: With dead ends: 12425 [2022-01-10 04:11:09,775 INFO L226 Difference]: Without dead ends: 3566 [2022-01-10 04:11:09,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:09,782 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 12 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:09,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 325 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:11:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2022-01-10 04:11:09,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 3326. [2022-01-10 04:11:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3326 states, 3325 states have (on average 1.2589473684210526) internal successors, (4186), 3325 states have internal predecessors, (4186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 4186 transitions. [2022-01-10 04:11:09,818 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 4186 transitions. Word has length 336 [2022-01-10 04:11:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:09,818 INFO L470 AbstractCegarLoop]: Abstraction has 3326 states and 4186 transitions. [2022-01-10 04:11:09,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4186 transitions. [2022-01-10 04:11:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-01-10 04:11:09,821 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:09,822 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 6, 6, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:09,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:10,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:10,029 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:10,029 INFO L85 PathProgramCache]: Analyzing trace with hash 627376354, now seen corresponding path program 1 times [2022-01-10 04:11:10,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:10,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631576369] [2022-01-10 04:11:10,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:10,030 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:10,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:10,031 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:10,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-01-10 04:11:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:10,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:10,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2022-01-10 04:11:10,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:10,570 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:10,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631576369] [2022-01-10 04:11:10,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631576369] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:10,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:10,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:10,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058773072] [2022-01-10 04:11:10,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:10,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:10,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:10,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:10,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:10,571 INFO L87 Difference]: Start difference. First operand 3326 states and 4186 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:10,707 INFO L93 Difference]: Finished difference Result 6391 states and 8072 transitions. [2022-01-10 04:11:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:10,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2022-01-10 04:11:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:10,728 INFO L225 Difference]: With dead ends: 6391 [2022-01-10 04:11:10,728 INFO L226 Difference]: Without dead ends: 3086 [2022-01-10 04:11:10,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:10,732 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 11 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:10,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 320 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:11:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2022-01-10 04:11:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 2855. [2022-01-10 04:11:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2855 states, 2854 states have (on average 1.2088297126839525) internal successors, (3450), 2854 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3450 transitions. [2022-01-10 04:11:10,793 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3450 transitions. Word has length 352 [2022-01-10 04:11:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:10,793 INFO L470 AbstractCegarLoop]: Abstraction has 2855 states and 3450 transitions. [2022-01-10 04:11:10,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3450 transitions. [2022-01-10 04:11:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2022-01-10 04:11:10,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:10,796 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:10,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:11,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:11,003 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash -288209027, now seen corresponding path program 1 times [2022-01-10 04:11:11,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:11,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476628807] [2022-01-10 04:11:11,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:11,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:11,005 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:11,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-01-10 04:11:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:11,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:11:11,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 881 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2022-01-10 04:11:11,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:11:11,600 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:11,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476628807] [2022-01-10 04:11:11,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476628807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:11:11,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:11:11,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:11:11,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29789750] [2022-01-10 04:11:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:11:11,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:11:11,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:11:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:11,602 INFO L87 Difference]: Start difference. First operand 2855 states and 3450 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:11,620 INFO L93 Difference]: Finished difference Result 2883 states and 3482 transitions. [2022-01-10 04:11:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:11:11,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 365 [2022-01-10 04:11:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:11,623 INFO L225 Difference]: With dead ends: 2883 [2022-01-10 04:11:11,623 INFO L226 Difference]: Without dead ends: 2621 [2022-01-10 04:11:11,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:11:11,626 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 123 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:11,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 275 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:11:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2022-01-10 04:11:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2595. [2022-01-10 04:11:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2594 states have (on average 1.215497301464919) internal successors, (3153), 2594 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3153 transitions. [2022-01-10 04:11:11,662 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3153 transitions. Word has length 365 [2022-01-10 04:11:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:11,662 INFO L470 AbstractCegarLoop]: Abstraction has 2595 states and 3153 transitions. [2022-01-10 04:11:11,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3153 transitions. [2022-01-10 04:11:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-01-10 04:11:11,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:11:11,666 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:11,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-01-10 04:11:11,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:11,873 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:11:11,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:11:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1940250332, now seen corresponding path program 1 times [2022-01-10 04:11:11,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:11:11,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034991470] [2022-01-10 04:11:11,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:11:11,874 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:11:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:11:11,875 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:11:11,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-01-10 04:11:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:11:11,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 04:11:11,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:11:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 525 proven. 23 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-01-10 04:11:12,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:11:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 525 proven. 23 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-01-10 04:11:12,850 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:11:12,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034991470] [2022-01-10 04:11:12,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034991470] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:11:12,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:11:12,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 04:11:12,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758154215] [2022-01-10 04:11:12,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:11:12,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:11:12,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:11:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:11:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:11:12,851 INFO L87 Difference]: Start difference. First operand 2595 states and 3153 transitions. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:11:13,078 INFO L93 Difference]: Finished difference Result 4555 states and 5560 transitions. [2022-01-10 04:11:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 04:11:13,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 423 [2022-01-10 04:11:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:11:13,079 INFO L225 Difference]: With dead ends: 4555 [2022-01-10 04:11:13,079 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 04:11:13,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 843 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 04:11:13,106 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 278 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 04:11:13,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 520 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 04:11:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 04:11:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 04:11:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 04:11:13,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 423 [2022-01-10 04:11:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:11:13,106 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 04:11:13,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:11:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 04:11:13,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 04:11:13,108 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 04:11:13,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-01-10 04:11:13,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:11:13,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L498(lines 498 500) no Hoare annotation was computed. [2022-01-10 04:11:18,037 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 578) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (let ((.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32)))) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32)))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32)))) (.cse0 (not .cse7)) (.cse2 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse6 .cse7 .cse8) (and .cse4 .cse5 .cse2 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse2 .cse3) (and .cse5 .cse9 .cse2 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv4 32)))))) [2022-01-10 04:11:18,037 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 589) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1))) [2022-01-10 04:11:18,037 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 599) the Hoare annotation is: (and (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32)))) [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L631-2(lines 631 633) no Hoare annotation was computed. [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 535) no Hoare annotation was computed. [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 369) no Hoare annotation was computed. [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L367-2(lines 364 373) no Hoare annotation was computed. [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L467(lines 467 469) no Hoare annotation was computed. [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-01-10 04:11:18,037 INFO L858 garLoopResultBuilder]: For program point L335-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 576) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 587) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 598) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L501(lines 501 505) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L501-2(lines 501 505) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L854 garLoopResultBuilder]: At program point L402(lines 393 428) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1))) [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 575) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 586) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 597) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L861 garLoopResultBuilder]: At program point L636(lines 22 638) the Hoare annotation is: true [2022-01-10 04:11:18,038 INFO L854 garLoopResultBuilder]: At program point L570(lines 110 625) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (let ((.cse15 (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse17 (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (= (_ bv8576 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse14 (= (_ bv8528 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (= (_ bv8560 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32))) (.cse12 (= (_ bv8592 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse13 (= (_ bv8512 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32))) (.cse20 (= (_ bv8672 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= (_ bv8656 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32)))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32)))) (.cse21 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8466 32))) (.cse19 (not .cse3)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32))) (.cse10 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv4 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse3) (and .cse7 .cse1 .cse3 .cse8) (and .cse5 .cse9 .cse3 .cse10) (and .cse5 .cse11 .cse4) (and .cse0 .cse12 .cse9 .cse3) (and .cse7 .cse1 .cse2 .cse13 .cse3) (and .cse7 .cse11 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse14) (and .cse0 .cse3 .cse15) (and .cse2 (= (_ bv3 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse6) (and .cse7 .cse3 .cse16) (and (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32)) .cse3 .cse10) (and .cse7 .cse3 .cse15) (and .cse7 .cse17 .cse9 .cse3) (and .cse0 .cse13 .cse3) (and .cse5 .cse3 .cse15) (and .cse1 .cse5 .cse12 .cse2 .cse3) (and .cse5 .cse9 .cse3 .cse18) (and .cse5 .cse3 .cse16) (and .cse19 .cse7 .cse11 .cse10) (and .cse1 .cse3 .cse20) (and .cse1 .cse5 .cse2 .cse3 .cse21) (and .cse0 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse21) (and .cse7 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse8) (and .cse0 .cse3 .cse14) (and .cse7 .cse1 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse17 .cse2 .cse3) (and .cse0 .cse9 .cse3 .cse18) (and .cse1 .cse5 .cse2 .cse3 .cse4) (and .cse0 .cse17 .cse9 .cse3) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse19 .cse5 .cse8) (and .cse7 .cse9 .cse3 .cse18) (and .cse5 .cse3 .cse14) (and .cse0 .cse3 .cse16) (and .cse19 .cse5 .cse11 .cse10) (and .cse7 .cse12 .cse9 .cse3) (and .cse19 .cse0 .cse11 .cse10) (and .cse19 .cse11 .cse22 .cse4) (and .cse1 .cse5 .cse2 .cse13 .cse3) (and .cse19 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32)) .cse20) (and .cse19 .cse5 .cse20) (and .cse19 .cse0 .cse8) (and .cse0 .cse11 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse21) (and .cse19 .cse11 .cse10 .cse22)))) [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L438(lines 438 440) no Hoare annotation was computed. [2022-01-10 04:11:18,038 INFO L858 garLoopResultBuilder]: For program point L405(lines 405 426) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 576) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32)))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32)))) (.cse5 (not .cse2)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse6 .cse1) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse4 .cse1)))) [2022-01-10 04:11:18,039 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 587) the Hoare annotation is: (let ((.cse0 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse1 .cse2))) [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 574) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 585) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 596) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 625) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (let ((.cse15 (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse17 (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (= (_ bv8576 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse14 (= (_ bv8528 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (= (_ bv8560 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32))) (.cse12 (= (_ bv8592 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse13 (= (_ bv8512 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32))) (.cse20 (= (_ bv8672 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= (_ bv8656 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32)))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32)))) (.cse21 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8466 32))) (.cse19 (not .cse3)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32))) (.cse10 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv4 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse3) (and .cse7 .cse1 .cse3 .cse8) (and .cse5 .cse9 .cse3 .cse10) (and .cse5 .cse11 .cse4) (and .cse0 .cse12 .cse9 .cse3) (and .cse7 .cse1 .cse2 .cse13 .cse3) (and .cse7 .cse11 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse14) (and .cse0 .cse3 .cse15) (and .cse2 (= (_ bv3 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse6) (and .cse7 .cse3 .cse16) (and (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32)) .cse3 .cse10) (and .cse7 .cse3 .cse15) (and .cse7 .cse17 .cse9 .cse3) (and .cse0 .cse13 .cse3) (and .cse5 .cse3 .cse15) (and .cse1 .cse5 .cse12 .cse2 .cse3) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8464 32)) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv0 32))) (and .cse5 .cse9 .cse3 .cse18) (and .cse5 .cse3 .cse16) (and .cse19 .cse7 .cse11 .cse10) (and .cse1 .cse3 .cse20) (and .cse1 .cse5 .cse2 .cse3 .cse21) (and .cse0 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse21) (and .cse7 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse8) (and .cse0 .cse3 .cse14) (and .cse7 .cse1 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse17 .cse2 .cse3) (and .cse0 .cse9 .cse3 .cse18) (and .cse1 .cse5 .cse2 .cse3 .cse4) (and .cse0 .cse17 .cse9 .cse3) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse19 .cse5 .cse8) (and .cse7 .cse9 .cse3 .cse18) (and .cse5 .cse3 .cse14) (and .cse0 .cse3 .cse16) (and .cse19 .cse5 .cse11 .cse10) (and .cse7 .cse12 .cse9 .cse3) (and .cse19 .cse0 .cse11 .cse10) (and .cse19 .cse11 .cse22 .cse4) (and .cse1 .cse5 .cse2 .cse13 .cse3) (and .cse19 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32)) .cse20) (and .cse19 .cse5 .cse20) (and .cse19 .cse0 .cse8) (and .cse0 .cse11 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse21) (and .cse19 .cse11 .cse10 .cse22)))) [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 542) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 585) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse4 (not .cse2)) (.cse6 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32))) (.cse3 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32)) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse4 .cse6 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv4 32)))))) [2022-01-10 04:11:18,039 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 598) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32)))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32)))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse1 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv0 32))))) [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 623) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L608(lines 608 622) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 385) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 573) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 584) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 595) no Hoare annotation was computed. [2022-01-10 04:11:18,039 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 606) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L609(lines 609 614) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L609-2(lines 608 622) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 574) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (let ((.cse2 (not .cse1)) (.cse0 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32))) .cse0 .cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32)))) (and .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32)) .cse0) (and .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse0)))) [2022-01-10 04:11:18,040 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 606) the Hoare annotation is: false [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L511(lines 511 514) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L611(lines 611 613) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 446 454) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 384) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L347-1(lines 347 384) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 572) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 583) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 594) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 605) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L854 garLoopResultBuilder]: At program point L414(lines 405 426) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1))) [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 381) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 325) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 325) no Hoare annotation was computed. [2022-01-10 04:11:18,040 INFO L861 garLoopResultBuilder]: At program point L216(lines 215 572) the Hoare annotation is: true [2022-01-10 04:11:18,040 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 584) the Hoare annotation is: (let ((.cse0 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32))) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32))) .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse3 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse3 .cse1 .cse2))) [2022-01-10 04:11:18,040 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 595) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32)))) (.cse1 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32)))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse1 .cse4) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse1 .cse2 .cse3 .cse4))) [2022-01-10 04:11:18,040 INFO L858 garLoopResultBuilder]: For program point L547(lines 547 551) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L547-2(lines 547 551) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 452) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 572) the Hoare annotation is: true [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 582) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 593) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 604) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L861 garLoopResultBuilder]: At program point L648(lines 639 650) the Hoare annotation is: true [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 526) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 419) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L616(lines 616 620) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 317 325) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 379) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 581) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 592) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 603) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L519(lines 519 525) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L420(lines 420 422) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-01-10 04:11:18,041 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 605) the Hoare annotation is: false [2022-01-10 04:11:18,041 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 582) the Hoare annotation is: (let ((.cse0 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32))) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32))) .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse3 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse3 .cse1 .cse2))) [2022-01-10 04:11:18,042 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 593) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32)))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32)))) (.cse1 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse1 .cse3 .cse4))) [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L356(lines 356 360) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L356-2(lines 356 360) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 580) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 591) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 602) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L522(lines 522 524) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L522-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 563) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 557 563) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 579) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 590) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 601) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 428) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 580) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32)))) (.cse1 (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32)))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32)))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) .cse0 .cse1 .cse2 .cse3))) [2022-01-10 04:11:18,042 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 591) the Hoare annotation is: (let ((.cse0 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32))) .cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32))) .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1 .cse2))) [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-01-10 04:11:18,042 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 462) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 400) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L861 garLoopResultBuilder]: At program point L626(lines 109 627) the Hoare annotation is: true [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L560(lines 560 562) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 578) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 589) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 600) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 635) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 497) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 601) the Hoare annotation is: false [2022-01-10 04:11:18,043 INFO L854 garLoopResultBuilder]: At program point L496(lines 83 637) the Hoare annotation is: false [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L463(lines 463 472) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 375) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 569) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L854 garLoopResultBuilder]: At program point L365(lines 341 386) the Hoare annotation is: (let ((.cse0 (not (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8545 32))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv7 32)) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8545 32))) .cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8544 32))) .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv6 32)) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1 .cse2))) [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 577) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 588) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 599) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-01-10 04:11:18,043 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 637) no Hoare annotation was computed. [2022-01-10 04:11:18,046 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:11:18,047 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 04:11:18,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:11:18 BoogieIcfgContainer [2022-01-10 04:11:18,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 04:11:18,093 INFO L158 Benchmark]: Toolchain (without parser) took 25534.13ms. Allocated memory was 208.7MB in the beginning and 520.1MB in the end (delta: 311.4MB). Free memory was 152.7MB in the beginning and 183.7MB in the end (delta: -30.9MB). Peak memory consumption was 293.0MB. Max. memory is 8.0GB. [2022-01-10 04:11:18,093 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 04:11:18,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.72ms. Allocated memory was 208.7MB in the beginning and 360.7MB in the end (delta: 152.0MB). Free memory was 152.5MB in the beginning and 329.2MB in the end (delta: -176.6MB). Peak memory consumption was 4.5MB. Max. memory is 8.0GB. [2022-01-10 04:11:18,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.33ms. Allocated memory is still 360.7MB. Free memory was 329.2MB in the beginning and 326.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 04:11:18,094 INFO L158 Benchmark]: Boogie Preprocessor took 21.95ms. Allocated memory is still 360.7MB. Free memory was 326.0MB in the beginning and 323.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 04:11:18,094 INFO L158 Benchmark]: RCFGBuilder took 573.21ms. Allocated memory is still 360.7MB. Free memory was 323.9MB in the beginning and 295.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-01-10 04:11:18,094 INFO L158 Benchmark]: TraceAbstraction took 24505.94ms. Allocated memory was 360.7MB in the beginning and 520.1MB in the end (delta: 159.4MB). Free memory was 294.6MB in the beginning and 183.7MB in the end (delta: 110.9MB). Peak memory consumption was 283.8MB. Max. memory is 8.0GB. [2022-01-10 04:11:18,095 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 393.72ms. Allocated memory was 208.7MB in the beginning and 360.7MB in the end (delta: 152.0MB). Free memory was 152.5MB in the beginning and 329.2MB in the end (delta: -176.6MB). Peak memory consumption was 4.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.33ms. Allocated memory is still 360.7MB. Free memory was 329.2MB in the beginning and 326.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.95ms. Allocated memory is still 360.7MB. Free memory was 326.0MB in the beginning and 323.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 573.21ms. Allocated memory is still 360.7MB. Free memory was 323.9MB in the beginning and 295.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 24505.94ms. Allocated memory was 360.7MB in the beginning and 520.1MB in the end (delta: 159.4MB). Free memory was 294.6MB in the beginning and 183.7MB in the end (delta: 110.9MB). Peak memory consumption was 283.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 635]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 27, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2542 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2542 mSDsluCounter, 11854 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4736 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3101 IncrementalHoareTripleChecker+Invalid, 3590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 7118 mSDtfsCounter, 3101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5878 GetRequests, 5836 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7344occurred in iteration=23, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 6411 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 313 NumberOfFragments, 2418 HoareAnnotationTreeSize, 28 FomulaSimplifications, 9921 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7799 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 4999 NumberOfCodeBlocks, 4999 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 5862 ConstructedInterpolants, 0 QuantifiedInterpolants, 8293 SizeOfPredicates, 6 NumberOfNonLiveVariables, 6126 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 15240/15382 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((blastFlag == 7bv32 && s__hit == 0bv32) && !(s__state == 8545bv32)) || ((blastFlag == 6bv32 && s__hit == 0bv32) && !(s__state == 8545bv32))) || ((blastFlag == 2bv32 && s__hit == 0bv32) && !(s__state == 8545bv32)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: !(8544bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || (((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__state == 8545bv32))) || ((!(s__hit == 0bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state))) || (((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) && !(s__state == 8545bv32))) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && !(8544bv32 == s__state)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && 8608bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) || (((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && 8608bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && 8640bv32 == s__state) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || (((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && s__hit == 0bv32) && 8656bv32 == s__state)) || (((blastFlag == 6bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8448bv32 == s__state)) || ((blastFlag == 6bv32 && s__s3__tmp__next_state___0 == 8640bv32) && 8640bv32 == s__state)) || (((blastFlag == 2bv32 && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && 8512bv32 == s__state) && s__hit == 0bv32)) || ((blastFlag == 7bv32 && s__s3__tmp__next_state___0 == 8640bv32) && 8640bv32 == s__state)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && 8528bv32 == s__state)) || ((blastFlag == 2bv32 && s__hit == 0bv32) && 8544bv32 == s__state)) || (!(s__s3__tmp__next_state___0 == 8544bv32) && 3bv32 == s__state)) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || ((blastFlag == 7bv32 && s__hit == 0bv32) && 8560bv32 == s__state)) || ((s__s3__tmp__next_state___0 == 3bv32 && s__hit == 0bv32) && 8448bv32 == s__state)) || ((blastFlag == 7bv32 && s__hit == 0bv32) && 8544bv32 == s__state)) || (((blastFlag == 7bv32 && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32)) || ((blastFlag == 2bv32 && 8512bv32 == s__state) && s__hit == 0bv32)) || ((blastFlag == 6bv32 && s__hit == 0bv32) && 8544bv32 == s__state)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && 8592bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || (((blastFlag == 6bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8576bv32 == s__state)) || ((blastFlag == 6bv32 && s__hit == 0bv32) && 8560bv32 == s__state)) || (((!(s__hit == 0bv32) && blastFlag == 7bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || ((!(s__s3__tmp__next_state___0 == 8545bv32) && s__hit == 0bv32) && 8672bv32 == s__state)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && s__state == 8466bv32)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8448bv32 == s__state)) || ((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && 8656bv32 == s__state)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && s__state == 8466bv32)) || (((blastFlag == 7bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8448bv32 == s__state)) || ((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || ((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && 8656bv32 == s__state)) || ((blastFlag == 2bv32 && s__hit == 0bv32) && 8528bv32 == s__state)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && 8608bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8576bv32 == s__state)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && 8640bv32 == s__state)) || (((blastFlag == 2bv32 && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && 8640bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 6bv32) && 8656bv32 == s__state)) || (((blastFlag == 7bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8576bv32 == s__state)) || ((blastFlag == 6bv32 && s__hit == 0bv32) && 8528bv32 == s__state)) || ((blastFlag == 2bv32 && s__hit == 0bv32) && 8560bv32 == s__state)) || (((!(s__hit == 0bv32) && blastFlag == 6bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || (((blastFlag == 7bv32 && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32)) || (((!(s__hit == 0bv32) && blastFlag == 2bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || (((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && blastFlag == 4bv32) && 8640bv32 == s__state)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(s__s3__tmp__next_state___0 == 8544bv32)) && 8512bv32 == s__state) && s__hit == 0bv32)) || ((!(s__hit == 0bv32) && blastFlag == 3bv32) && 8672bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 6bv32) && 8672bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && 8656bv32 == s__state)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8640bv32) && 8640bv32 == s__state)) || ((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && s__state == 8466bv32)) || (((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state) && blastFlag == 4bv32) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || (((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || (((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || ((!(8544bv32 == s__state) && !(s__state == 8545bv32)) && blastFlag == 0bv32) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && 8640bv32 == s__state) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || (((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && s__hit == 0bv32) && 8656bv32 == s__state)) || (((blastFlag == 6bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8448bv32 == s__state)) || ((blastFlag == 6bv32 && s__s3__tmp__next_state___0 == 8640bv32) && 8640bv32 == s__state)) || (((blastFlag == 2bv32 && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && 8512bv32 == s__state) && s__hit == 0bv32)) || ((blastFlag == 7bv32 && s__s3__tmp__next_state___0 == 8640bv32) && 8640bv32 == s__state)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && 8528bv32 == s__state)) || ((blastFlag == 2bv32 && s__hit == 0bv32) && 8544bv32 == s__state)) || (!(s__s3__tmp__next_state___0 == 8544bv32) && 3bv32 == s__state)) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || ((blastFlag == 7bv32 && s__hit == 0bv32) && 8560bv32 == s__state)) || ((s__s3__tmp__next_state___0 == 3bv32 && s__hit == 0bv32) && 8448bv32 == s__state)) || ((blastFlag == 7bv32 && s__hit == 0bv32) && 8544bv32 == s__state)) || (((blastFlag == 7bv32 && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32)) || ((blastFlag == 2bv32 && 8512bv32 == s__state) && s__hit == 0bv32)) || ((blastFlag == 6bv32 && s__hit == 0bv32) && 8544bv32 == s__state)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && 8592bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || (s__state == 8464bv32 && blastFlag == 0bv32)) || (((blastFlag == 6bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8576bv32 == s__state)) || ((blastFlag == 6bv32 && s__hit == 0bv32) && 8560bv32 == s__state)) || (((!(s__hit == 0bv32) && blastFlag == 7bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || ((!(s__s3__tmp__next_state___0 == 8545bv32) && s__hit == 0bv32) && 8672bv32 == s__state)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && s__state == 8466bv32)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8448bv32 == s__state)) || ((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && 8656bv32 == s__state)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && s__state == 8466bv32)) || (((blastFlag == 7bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8448bv32 == s__state)) || ((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || ((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && 8656bv32 == s__state)) || ((blastFlag == 2bv32 && s__hit == 0bv32) && 8528bv32 == s__state)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && 8608bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8576bv32 == s__state)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && 8640bv32 == s__state)) || (((blastFlag == 2bv32 && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32)) || ((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && 8640bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 6bv32) && 8656bv32 == s__state)) || (((blastFlag == 7bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8576bv32 == s__state)) || ((blastFlag == 6bv32 && s__hit == 0bv32) && 8528bv32 == s__state)) || ((blastFlag == 2bv32 && s__hit == 0bv32) && 8560bv32 == s__state)) || (((!(s__hit == 0bv32) && blastFlag == 6bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || (((blastFlag == 7bv32 && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32)) || (((!(s__hit == 0bv32) && blastFlag == 2bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || (((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && blastFlag == 4bv32) && 8640bv32 == s__state)) || ((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(s__s3__tmp__next_state___0 == 8544bv32)) && 8512bv32 == s__state) && s__hit == 0bv32)) || ((!(s__hit == 0bv32) && blastFlag == 3bv32) && 8672bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 6bv32) && 8672bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && 8656bv32 == s__state)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8640bv32) && 8640bv32 == s__state)) || ((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && s__state == 8466bv32)) || (((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state) && blastFlag == 4bv32) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: ((((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || (((blastFlag == 6bv32 && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || (((blastFlag == 2bv32 && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((blastFlag == 7bv32 && s__hit == 0bv32) && !(s__state == 8545bv32)) || ((blastFlag == 6bv32 && s__hit == 0bv32) && !(s__state == 8545bv32))) || ((blastFlag == 2bv32 && s__hit == 0bv32) && !(s__state == 8545bv32)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((blastFlag == 6bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8448bv32 == s__state) || ((s__s3__tmp__next_state___0 == 3bv32 && s__hit == 0bv32) && 8448bv32 == s__state)) || (((!(s__hit == 0bv32) && blastFlag == 7bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8448bv32 == s__state)) || (((blastFlag == 7bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && 8448bv32 == s__state)) || (((!(s__hit == 0bv32) && blastFlag == 6bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || (((!(s__hit == 0bv32) && blastFlag == 2bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || (((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state) && blastFlag == 4bv32) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || ((((blastFlag == 7bv32 && !(8544bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && !(s__state == 8545bv32))) || ((((blastFlag == 2bv32 && !(8544bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && !(s__state == 8545bv32)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((blastFlag == 7bv32 && s__hit == 0bv32) && !(s__state == 8545bv32)) || ((blastFlag == 6bv32 && s__hit == 0bv32) && !(s__state == 8545bv32))) || ((blastFlag == 2bv32 && s__hit == 0bv32) && !(s__state == 8545bv32)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((!(s__s3__tmp__next_state___0 == 8545bv32) && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || ((!(s__hit == 0bv32) && blastFlag == 3bv32) && !(8544bv32 == s__state))) || ((!(s__hit == 0bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || (((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || (((blastFlag == 2bv32 && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((blastFlag == 6bv32 && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || (((blastFlag == 2bv32 && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || (((blastFlag == 7bv32 && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || ((((blastFlag == 7bv32 && !(8544bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && !(s__state == 8545bv32))) || ((((blastFlag == 2bv32 && !(8544bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) && s__hit == 0bv32) && !(s__state == 8545bv32)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || (((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || ((blastFlag == 1bv32 && !(8544bv32 == s__state)) && !(s__state == 8545bv32))) || (((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((!(s__hit == 0bv32) && blastFlag == 7bv32) && !(8544bv32 == s__state)) && s__s3__tmp__next_state___0 == 8640bv32) || (((!(s__hit == 0bv32) && blastFlag == 2bv32) && !(8544bv32 == s__state)) && s__s3__tmp__next_state___0 == 8640bv32)) || (((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || (((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || (((!(s__hit == 0bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) && s__s3__tmp__next_state___0 == 8640bv32)) || (((((!(s__s3__tmp__next_state___0 == 8545bv32) && blastFlag == 6bv32) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || (((!(s__hit == 0bv32) && !(8544bv32 == s__state)) && s__s3__tmp__next_state___0 == 8640bv32) && blastFlag == 4bv32) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((blastFlag == 7bv32 && !(s__s3__tmp__next_state___0 == 8545bv32)) && !(8544bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8544bv32)) && s__hit == 0bv32) && !(s__state == 8545bv32)) || (((blastFlag == 6bv32 && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32))) || (((blastFlag == 2bv32 && !(8544bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 8545bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 04:11:18,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...