/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/bitvector/s3_clnt_2.BV.c.cil-1a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:39:55,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:39:55,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:39:55,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:39:55,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:39:55,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:39:55,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:39:55,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:39:55,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:39:55,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:39:55,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:39:55,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:39:55,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:39:55,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:39:55,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:39:55,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:39:55,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:39:55,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:39:55,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:39:55,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:39:55,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:39:55,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:39:55,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:39:55,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:39:55,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:39:55,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:39:55,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:39:55,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:39:55,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:39:55,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:39:55,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:39:55,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:39:55,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:39:55,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:39:55,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:39:55,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:39:55,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:39:55,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:39:55,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:39:55,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:39:55,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:39:55,627 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 02:39:55,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:39:55,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:39:55,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:39:55,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:39:55,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:39:55,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:39:55,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:39:55,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:39:55,654 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:39:55,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:39:55,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:39:55,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:39:55,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:39:55,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:39:55,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:39:55,655 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:39:55,655 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:39:55,655 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:39:55,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:39:55,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:39:55,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:39:55,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:39:55,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:39:55,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:39:55,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:39:55,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:39:55,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:39:55,657 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:39:55,657 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:39:55,658 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:39:55,658 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:39:55,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:39:55,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:39:55,658 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 02:39:55,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:39:55,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:39:55,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:39:55,857 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:39:55,858 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:39:55,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c [2022-01-10 02:39:55,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24cc31af9/ae73cb650a2841c6863b8f4da84f9fe8/FLAG4af234240 [2022-01-10 02:39:56,276 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:39:56,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c [2022-01-10 02:39:56,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24cc31af9/ae73cb650a2841c6863b8f4da84f9fe8/FLAG4af234240 [2022-01-10 02:39:56,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24cc31af9/ae73cb650a2841c6863b8f4da84f9fe8 [2022-01-10 02:39:56,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:39:56,305 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:39:56,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:39:56,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:39:56,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:39:56,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d027503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56, skipping insertion in model container [2022-01-10 02:39:56,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:39:56,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:39:56,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2022-01-10 02:39:56,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:39:56,515 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:39:56,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2022-01-10 02:39:56,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:39:56,557 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:39:56,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56 WrapperNode [2022-01-10 02:39:56,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:39:56,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:39:56,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:39:56,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:39:56,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,607 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 436 [2022-01-10 02:39:56,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:39:56,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:39:56,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:39:56,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:39:56,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:39:56,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:39:56,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:39:56,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:39:56,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (1/1) ... [2022-01-10 02:39:56,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:39:56,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:39:56,666 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 02:39:56,671 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 02:39:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:39:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:39:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:39:56,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:39:56,756 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:39:56,757 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:39:56,766 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 02:39:57,040 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-10 02:39:57,040 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-10 02:39:57,041 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:39:57,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:39:57,046 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 02:39:57,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:57 BoogieIcfgContainer [2022-01-10 02:39:57,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:39:57,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:39:57,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:39:57,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:39:57,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:39:56" (1/3) ... [2022-01-10 02:39:57,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7778d1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:39:57, skipping insertion in model container [2022-01-10 02:39:57,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:56" (2/3) ... [2022-01-10 02:39:57,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7778d1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:39:57, skipping insertion in model container [2022-01-10 02:39:57,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:57" (3/3) ... [2022-01-10 02:39:57,053 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2022-01-10 02:39:57,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:39:57,057 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:39:57,104 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:39:57,111 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 02:39:57,111 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:39:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 02:39:57,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:39:57,142 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] [2022-01-10 02:39:57,143 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:39:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:39:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2022-01-10 02:39:57,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:39:57,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601329175] [2022-01-10 02:39:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:39:57,157 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:39:57,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:39:57,160 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 02:39:57,161 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 02:39:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:39:57,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:39:57,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:39:57,338 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 02:39:57,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:39:57,338 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:39:57,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601329175] [2022-01-10 02:39:57,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601329175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:39:57,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:39:57,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:39:57,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60982900] [2022-01-10 02:39:57,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:39:57,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:39:57,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:39:57,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:39:57,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:39:57,376 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:39:57,515 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2022-01-10 02:39:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:39:57,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 02:39:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:39:57,531 INFO L225 Difference]: With dead ends: 246 [2022-01-10 02:39:57,532 INFO L226 Difference]: Without dead ends: 112 [2022-01-10 02:39:57,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 02:39:57,537 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 7 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:39:57,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 319 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:39:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-01-10 02:39:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-01-10 02:39:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2022-01-10 02:39:57,584 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2022-01-10 02:39:57,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:39:57,585 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2022-01-10 02:39:57,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2022-01-10 02:39:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 02:39:57,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:39:57,588 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:39:57,596 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 02:39:57,795 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 02:39:57,796 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:39:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:39:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2022-01-10 02:39:57,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:39:57,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905241763] [2022-01-10 02:39:57,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:39:57,797 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:39:57,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:39:57,799 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 02:39:57,805 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 02:39:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:39:57,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:39:57,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:39:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:39:57,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:39:57,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:39:57,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905241763] [2022-01-10 02:39:57,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905241763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:39:57,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:39:57,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:39:57,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661450895] [2022-01-10 02:39:57,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:39:57,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:39:57,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:39:57,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:39:57,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:39:57,942 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:39:58,051 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2022-01-10 02:39:58,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:39:58,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 02:39:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:39:58,052 INFO L225 Difference]: With dead ends: 233 [2022-01-10 02:39:58,052 INFO L226 Difference]: Without dead ends: 131 [2022-01-10 02:39:58,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 02:39:58,053 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:39:58,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 238 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:39:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-01-10 02:39:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-01-10 02:39:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2022-01-10 02:39:58,060 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2022-01-10 02:39:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:39:58,060 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2022-01-10 02:39:58,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2022-01-10 02:39:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-10 02:39:58,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:39:58,061 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:39:58,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 02:39:58,269 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 02:39:58,269 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:39:58,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:39:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2022-01-10 02:39:58,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:39:58,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823677586] [2022-01-10 02:39:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:39:58,270 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:39:58,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:39:58,271 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 02:39:58,274 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 02:39:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:39:58,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:39:58,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:39:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 02:39:58,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:39:58,414 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:39:58,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823677586] [2022-01-10 02:39:58,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823677586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:39:58,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:39:58,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:39:58,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789450913] [2022-01-10 02:39:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:39:58,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:39:58,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:39:58,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:39:58,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:39:58,421 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:39:58,514 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2022-01-10 02:39:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:39:58,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-01-10 02:39:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:39:58,518 INFO L225 Difference]: With dead ends: 265 [2022-01-10 02:39:58,518 INFO L226 Difference]: Without dead ends: 148 [2022-01-10 02:39:58,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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 02:39:58,523 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 15 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:39:58,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 251 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:39:58,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-01-10 02:39:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2022-01-10 02:39:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2022-01-10 02:39:58,535 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2022-01-10 02:39:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:39:58,536 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2022-01-10 02:39:58,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2022-01-10 02:39:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 02:39:58,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:39:58,537 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:39:58,545 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 02:39:58,745 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 02:39:58,745 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:39:58,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:39:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2022-01-10 02:39:58,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:39:58,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830275356] [2022-01-10 02:39:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:39:58,746 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:39:58,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:39:58,747 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 02:39:58,748 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 02:39:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:39:58,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:39:58,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:39:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:39:58,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:39:58,878 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:39:58,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830275356] [2022-01-10 02:39:58,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830275356] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:39:58,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:39:58,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:39:58,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618862810] [2022-01-10 02:39:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:39:58,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:39:58,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:39:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:39:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:39:58,881 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 02:39:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:39:59,028 INFO L93 Difference]: Finished difference Result 321 states and 487 transitions. [2022-01-10 02:39:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:39:59,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-01-10 02:39:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:39:59,030 INFO L225 Difference]: With dead ends: 321 [2022-01-10 02:39:59,030 INFO L226 Difference]: Without dead ends: 187 [2022-01-10 02:39:59,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 02:39:59,031 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 28 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:39:59,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 233 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:39:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-01-10 02:39:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2022-01-10 02:39:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.3989071038251366) internal successors, (256), 183 states have internal predecessors, (256), 0 states have call successors, (0), 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 02:39:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 256 transitions. [2022-01-10 02:39:59,037 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 256 transitions. Word has length 67 [2022-01-10 02:39:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:39:59,037 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 256 transitions. [2022-01-10 02:39:59,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 02:39:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 256 transitions. [2022-01-10 02:39:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 02:39:59,038 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:39:59,038 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:39:59,044 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 02:39:59,244 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 02:39:59,245 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:39:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:39:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1434615126, now seen corresponding path program 1 times [2022-01-10 02:39:59,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:39:59,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443153871] [2022-01-10 02:39:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:39:59,246 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:39:59,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:39:59,247 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 02:39:59,248 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 02:39:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:39:59,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:39:59,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:39:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:39:59,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:39:59,353 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:39:59,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443153871] [2022-01-10 02:39:59,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443153871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:39:59,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:39:59,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:39:59,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110821434] [2022-01-10 02:39:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:39:59,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:39:59,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:39:59,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:39:59,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:39:59,359 INFO L87 Difference]: Start difference. First operand 184 states and 256 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 02:39:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:39:59,446 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2022-01-10 02:39:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:39:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-01-10 02:39:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:39:59,448 INFO L225 Difference]: With dead ends: 381 [2022-01-10 02:39:59,448 INFO L226 Difference]: Without dead ends: 207 [2022-01-10 02:39:59,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 02:39:59,449 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:39:59,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 256 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:39:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-01-10 02:39:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2022-01-10 02:39:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.386138613861386) internal successors, (280), 202 states have internal predecessors, (280), 0 states have call successors, (0), 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 02:39:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 280 transitions. [2022-01-10 02:39:59,461 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 280 transitions. Word has length 67 [2022-01-10 02:39:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:39:59,463 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 280 transitions. [2022-01-10 02:39:59,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 02:39:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 280 transitions. [2022-01-10 02:39:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 02:39:59,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:39:59,467 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:39:59,479 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 02:39:59,673 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 02:39:59,673 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:39:59,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:39:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1023824768, now seen corresponding path program 1 times [2022-01-10 02:39:59,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:39:59,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824607966] [2022-01-10 02:39:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:39:59,675 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:39:59,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:39:59,676 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 02:39:59,677 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 02:39:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:39:59,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:39:59,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:39:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 02:39:59,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:39:59,812 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:39:59,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824607966] [2022-01-10 02:39:59,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824607966] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:39:59,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:39:59,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:39:59,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876396353] [2022-01-10 02:39:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:39:59,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:39:59,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:39:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:39:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:39:59,813 INFO L87 Difference]: Start difference. First operand 203 states and 280 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 02:39:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:39:59,899 INFO L93 Difference]: Finished difference Result 420 states and 588 transitions. [2022-01-10 02:39:59,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:39:59,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 83 [2022-01-10 02:39:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:39:59,900 INFO L225 Difference]: With dead ends: 420 [2022-01-10 02:39:59,900 INFO L226 Difference]: Without dead ends: 227 [2022-01-10 02:39:59,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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 02:39:59,901 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 13 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:39:59,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 255 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:39:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-01-10 02:39:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2022-01-10 02:39:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.3721973094170403) internal successors, (306), 223 states have internal predecessors, (306), 0 states have call successors, (0), 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 02:39:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 306 transitions. [2022-01-10 02:39:59,905 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 306 transitions. Word has length 83 [2022-01-10 02:39:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:39:59,906 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 306 transitions. [2022-01-10 02:39:59,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 02:39:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 306 transitions. [2022-01-10 02:39:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 02:39:59,906 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:39:59,907 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:39:59,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 02:40:00,115 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 02:40:00,115 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2022-01-10 02:40:00,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:00,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566487655] [2022-01-10 02:40:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:00,116 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:00,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:00,117 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 02:40:00,117 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 02:40:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:00,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:00,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 02:40:00,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:00,329 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:00,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566487655] [2022-01-10 02:40:00,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566487655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:00,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:00,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:00,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015299269] [2022-01-10 02:40:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:00,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:00,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:00,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:00,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:00,330 INFO L87 Difference]: Start difference. First operand 224 states and 306 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 02:40:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:00,353 INFO L93 Difference]: Finished difference Result 649 states and 888 transitions. [2022-01-10 02:40:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:00,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-10 02:40:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:00,355 INFO L225 Difference]: With dead ends: 649 [2022-01-10 02:40:00,355 INFO L226 Difference]: Without dead ends: 435 [2022-01-10 02:40:00,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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 02:40:00,356 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:00,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 356 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-10 02:40:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2022-01-10 02:40:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.359447004608295) internal successors, (590), 434 states have internal predecessors, (590), 0 states have call successors, (0), 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 02:40:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 590 transitions. [2022-01-10 02:40:00,363 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 590 transitions. Word has length 103 [2022-01-10 02:40:00,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:00,363 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 590 transitions. [2022-01-10 02:40:00,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 02:40:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 590 transitions. [2022-01-10 02:40:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 02:40:00,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:00,364 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:00,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 02:40:00,572 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 02:40:00,572 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash -713589126, now seen corresponding path program 1 times [2022-01-10 02:40:00,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:00,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423160648] [2022-01-10 02:40:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:00,573 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:00,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:00,574 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 02:40:00,575 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 02:40:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:00,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:00,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-10 02:40:00,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:00,734 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:00,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423160648] [2022-01-10 02:40:00,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423160648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:00,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:00,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:00,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636388752] [2022-01-10 02:40:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:00,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:00,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:00,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:00,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:00,735 INFO L87 Difference]: Start difference. First operand 435 states and 590 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:00,750 INFO L93 Difference]: Finished difference Result 881 states and 1194 transitions. [2022-01-10 02:40:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:00,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-10 02:40:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:00,751 INFO L225 Difference]: With dead ends: 881 [2022-01-10 02:40:00,751 INFO L226 Difference]: Without dead ends: 456 [2022-01-10 02:40:00,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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 02:40:00,752 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 11 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:00,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-01-10 02:40:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2022-01-10 02:40:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.3560439560439561) internal successors, (617), 455 states have internal predecessors, (617), 0 states have call successors, (0), 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 02:40:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 617 transitions. [2022-01-10 02:40:00,759 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 617 transitions. Word has length 103 [2022-01-10 02:40:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:00,760 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 617 transitions. [2022-01-10 02:40:00,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 617 transitions. [2022-01-10 02:40:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 02:40:00,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:00,761 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:00,783 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 02:40:00,967 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 02:40:00,967 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1034569449, now seen corresponding path program 1 times [2022-01-10 02:40:00,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097748467] [2022-01-10 02:40:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:00,968 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:00,969 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 02:40:00,970 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 02:40:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:01,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:01,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-10 02:40:01,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:01,156 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:01,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097748467] [2022-01-10 02:40:01,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097748467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:01,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:01,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:01,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032791286] [2022-01-10 02:40:01,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:01,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:01,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:01,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:01,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:01,158 INFO L87 Difference]: Start difference. First operand 456 states and 617 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:01,171 INFO L93 Difference]: Finished difference Result 928 states and 1254 transitions. [2022-01-10 02:40:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-01-10 02:40:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:01,172 INFO L225 Difference]: With dead ends: 928 [2022-01-10 02:40:01,172 INFO L226 Difference]: Without dead ends: 482 [2022-01-10 02:40:01,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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 02:40:01,173 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 20 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:01,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 309 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-01-10 02:40:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-01-10 02:40:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.3513513513513513) internal successors, (650), 481 states have internal predecessors, (650), 0 states have call successors, (0), 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 02:40:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 650 transitions. [2022-01-10 02:40:01,181 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 650 transitions. Word has length 104 [2022-01-10 02:40:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:01,181 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 650 transitions. [2022-01-10 02:40:01,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 650 transitions. [2022-01-10 02:40:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 02:40:01,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:01,182 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:01,190 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 02:40:01,388 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 02:40:01,389 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:01,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:01,389 INFO L85 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2022-01-10 02:40:01,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:01,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005818239] [2022-01-10 02:40:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:01,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:01,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:01,390 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 02:40:01,393 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 02:40:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:01,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:01,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 02:40:01,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:01,541 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:01,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005818239] [2022-01-10 02:40:01,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005818239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:01,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:01,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:01,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664451809] [2022-01-10 02:40:01,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:01,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:01,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:01,542 INFO L87 Difference]: Start difference. First operand 482 states and 650 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 02:40:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:01,573 INFO L93 Difference]: Finished difference Result 1121 states and 1519 transitions. [2022-01-10 02:40:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:01,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-10 02:40:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:01,575 INFO L225 Difference]: With dead ends: 1121 [2022-01-10 02:40:01,575 INFO L226 Difference]: Without dead ends: 675 [2022-01-10 02:40:01,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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 02:40:01,576 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:01,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 456 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-01-10 02:40:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2022-01-10 02:40:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.3501483679525224) internal successors, (910), 674 states have internal predecessors, (910), 0 states have call successors, (0), 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 02:40:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 910 transitions. [2022-01-10 02:40:01,586 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 910 transitions. Word has length 105 [2022-01-10 02:40:01,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:01,586 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 910 transitions. [2022-01-10 02:40:01,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 02:40:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 910 transitions. [2022-01-10 02:40:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 02:40:01,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:01,587 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:01,597 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 02:40:01,793 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 02:40:01,794 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:01,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash -187333376, now seen corresponding path program 1 times [2022-01-10 02:40:01,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:01,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971701270] [2022-01-10 02:40:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:01,794 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:01,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:01,795 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 02:40:01,803 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 02:40:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:01,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:01,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 02:40:01,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:01,955 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:01,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971701270] [2022-01-10 02:40:01,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971701270] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:01,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:01,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:01,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717031429] [2022-01-10 02:40:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:01,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:01,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:01,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:01,957 INFO L87 Difference]: Start difference. First operand 675 states and 910 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 02:40:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:01,972 INFO L93 Difference]: Finished difference Result 1339 states and 1804 transitions. [2022-01-10 02:40:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-10 02:40:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:01,974 INFO L225 Difference]: With dead ends: 1339 [2022-01-10 02:40:01,974 INFO L226 Difference]: Without dead ends: 700 [2022-01-10 02:40:01,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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 02:40:01,975 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 10 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:01,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 346 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-01-10 02:40:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2022-01-10 02:40:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 699 states have (on average 1.3447782546494993) internal successors, (940), 699 states have internal predecessors, (940), 0 states have call successors, (0), 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 02:40:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 940 transitions. [2022-01-10 02:40:01,985 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 940 transitions. Word has length 105 [2022-01-10 02:40:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:01,985 INFO L470 AbstractCegarLoop]: Abstraction has 700 states and 940 transitions. [2022-01-10 02:40:01,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 02:40:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 940 transitions. [2022-01-10 02:40:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-01-10 02:40:01,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:01,987 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:01,993 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 02:40:02,193 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 02:40:02,193 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:02,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2022-01-10 02:40:02,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:02,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963974852] [2022-01-10 02:40:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:02,194 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:02,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:02,195 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 02:40:02,196 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 02:40:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:02,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:02,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-01-10 02:40:02,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:02,427 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:02,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963974852] [2022-01-10 02:40:02,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963974852] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:02,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:02,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:02,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671959367] [2022-01-10 02:40:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:02,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:02,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:02,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:02,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:02,429 INFO L87 Difference]: Start difference. First operand 700 states and 940 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 02:40:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:02,532 INFO L93 Difference]: Finished difference Result 1444 states and 1970 transitions. [2022-01-10 02:40:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:02,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2022-01-10 02:40:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:02,534 INFO L225 Difference]: With dead ends: 1444 [2022-01-10 02:40:02,534 INFO L226 Difference]: Without dead ends: 780 [2022-01-10 02:40:02,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 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 02:40:02,536 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:02,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 254 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-01-10 02:40:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 769. [2022-01-10 02:40:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 1.3333333333333333) internal successors, (1024), 768 states have internal predecessors, (1024), 0 states have call successors, (0), 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 02:40:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1024 transitions. [2022-01-10 02:40:02,547 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1024 transitions. Word has length 173 [2022-01-10 02:40:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:02,547 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1024 transitions. [2022-01-10 02:40:02,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 02:40:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1024 transitions. [2022-01-10 02:40:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-01-10 02:40:02,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:02,549 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:02,559 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 02:40:02,755 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 02:40:02,755 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:02,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2022-01-10 02:40:02,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:02,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462383975] [2022-01-10 02:40:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:02,756 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:02,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:02,757 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 02:40:02,759 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 02:40:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:02,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:40:02,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 456 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-01-10 02:40:03,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 440 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-01-10 02:40:03,382 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:03,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462383975] [2022-01-10 02:40:03,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462383975] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:03,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:03,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 02:40:03,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785052839] [2022-01-10 02:40:03,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:03,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:40:03,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:40:03,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:40:03,383 INFO L87 Difference]: Start difference. First operand 769 states and 1024 transitions. Second operand has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 0 states have call successors, (0), 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 02:40:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:03,709 INFO L93 Difference]: Finished difference Result 1949 states and 2650 transitions. [2022-01-10 02:40:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:40:03,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2022-01-10 02:40:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:03,713 INFO L225 Difference]: With dead ends: 1949 [2022-01-10 02:40:03,714 INFO L226 Difference]: Without dead ends: 1216 [2022-01-10 02:40:03,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:40:03,716 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 500 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:03,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 654 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:40:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2022-01-10 02:40:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1115. [2022-01-10 02:40:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.3447037701974864) internal successors, (1498), 1114 states have internal predecessors, (1498), 0 states have call successors, (0), 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 02:40:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1498 transitions. [2022-01-10 02:40:03,736 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1498 transitions. Word has length 194 [2022-01-10 02:40:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:03,736 INFO L470 AbstractCegarLoop]: Abstraction has 1115 states and 1498 transitions. [2022-01-10 02:40:03,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 0 states have call successors, (0), 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 02:40:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1498 transitions. [2022-01-10 02:40:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-01-10 02:40:03,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:03,738 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:03,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-01-10 02:40:03,944 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 02:40:03,945 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1233429647, now seen corresponding path program 1 times [2022-01-10 02:40:03,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:03,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004891912] [2022-01-10 02:40:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:03,946 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:03,946 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 02:40:03,948 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 02:40:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:04,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:04,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-10 02:40:04,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:04,217 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:04,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004891912] [2022-01-10 02:40:04,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004891912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:04,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:04,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:04,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112762744] [2022-01-10 02:40:04,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:04,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:04,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:04,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:04,218 INFO L87 Difference]: Start difference. First operand 1115 states and 1498 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 02:40:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:04,306 INFO L93 Difference]: Finished difference Result 2293 states and 3130 transitions. [2022-01-10 02:40:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 219 [2022-01-10 02:40:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:04,310 INFO L225 Difference]: With dead ends: 2293 [2022-01-10 02:40:04,310 INFO L226 Difference]: Without dead ends: 1235 [2022-01-10 02:40:04,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 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 02:40:04,311 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 21 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:04,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 256 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2022-01-10 02:40:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1227. [2022-01-10 02:40:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1226 states have (on average 1.32952691680261) internal successors, (1630), 1226 states have internal predecessors, (1630), 0 states have call successors, (0), 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 02:40:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1630 transitions. [2022-01-10 02:40:04,328 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1630 transitions. Word has length 219 [2022-01-10 02:40:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:04,328 INFO L470 AbstractCegarLoop]: Abstraction has 1227 states and 1630 transitions. [2022-01-10 02:40:04,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 02:40:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1630 transitions. [2022-01-10 02:40:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-01-10 02:40:04,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:04,331 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:04,339 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 02:40:04,537 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 02:40:04,538 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1261929937, now seen corresponding path program 1 times [2022-01-10 02:40:04,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:04,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80780505] [2022-01-10 02:40:04,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:04,538 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:04,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:04,539 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 02:40:04,540 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 02:40:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:04,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:04,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-10 02:40:04,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:04,797 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80780505] [2022-01-10 02:40:04,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80780505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:04,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:04,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:04,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98918131] [2022-01-10 02:40:04,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:04,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:04,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:04,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:04,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:04,799 INFO L87 Difference]: Start difference. First operand 1227 states and 1630 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 02:40:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:04,892 INFO L93 Difference]: Finished difference Result 2533 states and 3430 transitions. [2022-01-10 02:40:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:04,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 219 [2022-01-10 02:40:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:04,895 INFO L225 Difference]: With dead ends: 2533 [2022-01-10 02:40:04,896 INFO L226 Difference]: Without dead ends: 1363 [2022-01-10 02:40:04,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 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 02:40:04,898 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:04,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 257 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2022-01-10 02:40:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1351. [2022-01-10 02:40:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1350 states have (on average 1.3140740740740742) internal successors, (1774), 1350 states have internal predecessors, (1774), 0 states have call successors, (0), 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 02:40:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1774 transitions. [2022-01-10 02:40:04,930 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1774 transitions. Word has length 219 [2022-01-10 02:40:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:04,930 INFO L470 AbstractCegarLoop]: Abstraction has 1351 states and 1774 transitions. [2022-01-10 02:40:04,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 02:40:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1774 transitions. [2022-01-10 02:40:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-01-10 02:40:04,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:04,933 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:04,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:05,140 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 02:40:05,140 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash -677565169, now seen corresponding path program 1 times [2022-01-10 02:40:05,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:05,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884550779] [2022-01-10 02:40:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:05,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:05,142 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 02:40:05,143 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 02:40:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:05,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:05,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2022-01-10 02:40:05,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:05,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:05,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884550779] [2022-01-10 02:40:05,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884550779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:05,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:05,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:05,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987783186] [2022-01-10 02:40:05,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:05,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:05,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:05,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:05,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:05,495 INFO L87 Difference]: Start difference. First operand 1351 states and 1774 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:05,591 INFO L93 Difference]: Finished difference Result 2801 states and 3750 transitions. [2022-01-10 02:40:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:05,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2022-01-10 02:40:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:05,596 INFO L225 Difference]: With dead ends: 2801 [2022-01-10 02:40:05,596 INFO L226 Difference]: Without dead ends: 1507 [2022-01-10 02:40:05,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 247 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 02:40:05,597 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 30 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:05,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 257 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2022-01-10 02:40:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1499. [2022-01-10 02:40:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1498 states have (on average 1.2963951935914553) internal successors, (1942), 1498 states have internal predecessors, (1942), 0 states have call successors, (0), 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 02:40:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1942 transitions. [2022-01-10 02:40:05,619 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1942 transitions. Word has length 249 [2022-01-10 02:40:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:05,619 INFO L470 AbstractCegarLoop]: Abstraction has 1499 states and 1942 transitions. [2022-01-10 02:40:05,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1942 transitions. [2022-01-10 02:40:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-01-10 02:40:05,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:05,622 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:05,631 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 02:40:05,829 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 02:40:05,830 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:05,830 INFO L85 PathProgramCache]: Analyzing trace with hash -649064879, now seen corresponding path program 1 times [2022-01-10 02:40:05,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:05,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516452009] [2022-01-10 02:40:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:05,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:05,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:05,831 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 02:40:05,832 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 02:40:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:05,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:05,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2022-01-10 02:40:06,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:06,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:06,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516452009] [2022-01-10 02:40:06,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516452009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:06,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:06,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:06,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801539812] [2022-01-10 02:40:06,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:06,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:06,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:06,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:06,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:06,132 INFO L87 Difference]: Start difference. First operand 1499 states and 1942 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 02:40:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:06,168 INFO L93 Difference]: Finished difference Result 4263 states and 5538 transitions. [2022-01-10 02:40:06,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:06,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 249 [2022-01-10 02:40:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:06,176 INFO L225 Difference]: With dead ends: 4263 [2022-01-10 02:40:06,176 INFO L226 Difference]: Without dead ends: 2821 [2022-01-10 02:40:06,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 247 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 02:40:06,179 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 123 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:06,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 478 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2022-01-10 02:40:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2819. [2022-01-10 02:40:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2818 states have (on average 1.2991483321504613) internal successors, (3661), 2818 states have internal predecessors, (3661), 0 states have call successors, (0), 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 02:40:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3661 transitions. [2022-01-10 02:40:06,250 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3661 transitions. Word has length 249 [2022-01-10 02:40:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:06,250 INFO L470 AbstractCegarLoop]: Abstraction has 2819 states and 3661 transitions. [2022-01-10 02:40:06,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 02:40:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3661 transitions. [2022-01-10 02:40:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-01-10 02:40:06,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:06,254 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:06,276 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 02:40:06,461 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 02:40:06,462 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash -500620377, now seen corresponding path program 1 times [2022-01-10 02:40:06,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:06,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216635091] [2022-01-10 02:40:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:06,463 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:06,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:06,464 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 02:40:06,464 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 02:40:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:06,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:06,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 603 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-01-10 02:40:06,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:06,808 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:06,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216635091] [2022-01-10 02:40:06,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216635091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:06,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:06,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:06,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409843200] [2022-01-10 02:40:06,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:06,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:06,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:06,811 INFO L87 Difference]: Start difference. First operand 2819 states and 3661 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 02:40:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:06,918 INFO L93 Difference]: Finished difference Result 5729 states and 7508 transitions. [2022-01-10 02:40:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:06,919 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 273 [2022-01-10 02:40:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:06,926 INFO L225 Difference]: With dead ends: 5729 [2022-01-10 02:40:06,926 INFO L226 Difference]: Without dead ends: 2967 [2022-01-10 02:40:06,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 271 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 02:40:06,930 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 27 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:06,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 257 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2022-01-10 02:40:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2951. [2022-01-10 02:40:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2950 states have (on average 1.2925423728813559) internal successors, (3813), 2950 states have internal predecessors, (3813), 0 states have call successors, (0), 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 02:40:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 3813 transitions. [2022-01-10 02:40:06,972 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 3813 transitions. Word has length 273 [2022-01-10 02:40:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:06,973 INFO L470 AbstractCegarLoop]: Abstraction has 2951 states and 3813 transitions. [2022-01-10 02:40:06,973 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 02:40:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 3813 transitions. [2022-01-10 02:40:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-01-10 02:40:06,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:06,978 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:06,989 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 02:40:07,185 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 02:40:07,186 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash 845221264, now seen corresponding path program 1 times [2022-01-10 02:40:07,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:07,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840372735] [2022-01-10 02:40:07,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:07,187 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:07,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:07,192 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 02:40:07,215 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 02:40:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:07,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:07,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 603 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2022-01-10 02:40:07,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:07,548 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:07,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840372735] [2022-01-10 02:40:07,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840372735] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:07,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:07,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:07,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457030816] [2022-01-10 02:40:07,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:07,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:07,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:07,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:07,549 INFO L87 Difference]: Start difference. First operand 2951 states and 3813 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 02:40:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:07,665 INFO L93 Difference]: Finished difference Result 6157 states and 8120 transitions. [2022-01-10 02:40:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:07,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 284 [2022-01-10 02:40:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:07,674 INFO L225 Difference]: With dead ends: 6157 [2022-01-10 02:40:07,674 INFO L226 Difference]: Without dead ends: 3263 [2022-01-10 02:40:07,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 282 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 02:40:07,677 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 32 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:07,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 252 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2022-01-10 02:40:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 3247. [2022-01-10 02:40:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 3246 states have (on average 1.27818853974122) internal successors, (4149), 3246 states have internal predecessors, (4149), 0 states have call successors, (0), 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 02:40:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 4149 transitions. [2022-01-10 02:40:07,724 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 4149 transitions. Word has length 284 [2022-01-10 02:40:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:07,725 INFO L470 AbstractCegarLoop]: Abstraction has 3247 states and 4149 transitions. [2022-01-10 02:40:07,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 02:40:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 4149 transitions. [2022-01-10 02:40:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2022-01-10 02:40:07,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:07,730 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:07,749 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 02:40:07,937 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 02:40:07,937 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:07,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash -294382625, now seen corresponding path program 1 times [2022-01-10 02:40:07,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:07,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626408116] [2022-01-10 02:40:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:07,938 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:07,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:07,939 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 02:40:07,968 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 02:40:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:08,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:08,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 02:40:08,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:08,347 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:08,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626408116] [2022-01-10 02:40:08,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626408116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:08,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:08,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:08,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873265052] [2022-01-10 02:40:08,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:08,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:08,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:08,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:08,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:08,348 INFO L87 Difference]: Start difference. First operand 3247 states and 4149 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:08,464 INFO L93 Difference]: Finished difference Result 6773 states and 8840 transitions. [2022-01-10 02:40:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2022-01-10 02:40:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:08,473 INFO L225 Difference]: With dead ends: 6773 [2022-01-10 02:40:08,473 INFO L226 Difference]: Without dead ends: 3583 [2022-01-10 02:40:08,476 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 02:40:08,477 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:08,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 250 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2022-01-10 02:40:08,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3575. [2022-01-10 02:40:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3575 states, 3574 states have (on average 1.2638500279798546) internal successors, (4517), 3574 states have internal predecessors, (4517), 0 states have call successors, (0), 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 02:40:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 4517 transitions. [2022-01-10 02:40:08,543 INFO L78 Accepts]: Start accepts. Automaton has 3575 states and 4517 transitions. Word has length 320 [2022-01-10 02:40:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:08,544 INFO L470 AbstractCegarLoop]: Abstraction has 3575 states and 4517 transitions. [2022-01-10 02:40:08,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 4517 transitions. [2022-01-10 02:40:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-01-10 02:40:08,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:08,549 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:08,561 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 02:40:08,756 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 02:40:08,756 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1830888093, now seen corresponding path program 1 times [2022-01-10 02:40:08,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:08,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728699328] [2022-01-10 02:40:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:08,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:08,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:08,758 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 02:40:08,759 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 02:40:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:08,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:08,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2022-01-10 02:40:09,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:09,137 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:09,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728699328] [2022-01-10 02:40:09,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728699328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:09,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:09,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:09,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288785087] [2022-01-10 02:40:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:09,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:09,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:09,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:09,139 INFO L87 Difference]: Start difference. First operand 3575 states and 4517 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:09,177 INFO L93 Difference]: Finished difference Result 9466 states and 11991 transitions. [2022-01-10 02:40:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:09,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2022-01-10 02:40:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:09,200 INFO L225 Difference]: With dead ends: 9466 [2022-01-10 02:40:09,200 INFO L226 Difference]: Without dead ends: 5948 [2022-01-10 02:40:09,205 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 02:40:09,206 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 127 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 397 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 02:40:09,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 397 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2022-01-10 02:40:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 5946. [2022-01-10 02:40:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5946 states, 5945 states have (on average 1.2654331370899916) internal successors, (7523), 5945 states have internal predecessors, (7523), 0 states have call successors, (0), 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 02:40:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5946 states to 5946 states and 7523 transitions. [2022-01-10 02:40:09,318 INFO L78 Accepts]: Start accepts. Automaton has 5946 states and 7523 transitions. Word has length 321 [2022-01-10 02:40:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:09,318 INFO L470 AbstractCegarLoop]: Abstraction has 5946 states and 7523 transitions. [2022-01-10 02:40:09,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5946 states and 7523 transitions. [2022-01-10 02:40:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2022-01-10 02:40:09,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:09,325 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:09,337 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 02:40:09,531 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 02:40:09,532 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:09,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash 562644076, now seen corresponding path program 1 times [2022-01-10 02:40:09,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:09,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942234765] [2022-01-10 02:40:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:09,533 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:09,533 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 02:40:09,534 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 02:40:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:09,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:09,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 903 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 02:40:09,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 903 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 02:40:10,304 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:10,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942234765] [2022-01-10 02:40:10,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942234765] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:10,304 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:10,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:40:10,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272361778] [2022-01-10 02:40:10,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:10,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:40:10,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:40:10,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:40:10,305 INFO L87 Difference]: Start difference. First operand 5946 states and 7523 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 02:40:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:10,811 INFO L93 Difference]: Finished difference Result 13752 states and 17307 transitions. [2022-01-10 02:40:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:40:10,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 357 [2022-01-10 02:40:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:10,828 INFO L225 Difference]: With dead ends: 13752 [2022-01-10 02:40:10,828 INFO L226 Difference]: Without dead ends: 7865 [2022-01-10 02:40:10,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:40:10,835 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 466 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:10,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 865 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:40:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7865 states. [2022-01-10 02:40:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7865 to 6000. [2022-01-10 02:40:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6000 states, 5999 states have (on average 1.2460410068344725) internal successors, (7475), 5999 states have internal predecessors, (7475), 0 states have call successors, (0), 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 02:40:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6000 states to 6000 states and 7475 transitions. [2022-01-10 02:40:10,919 INFO L78 Accepts]: Start accepts. Automaton has 6000 states and 7475 transitions. Word has length 357 [2022-01-10 02:40:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:10,920 INFO L470 AbstractCegarLoop]: Abstraction has 6000 states and 7475 transitions. [2022-01-10 02:40:10,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 02:40:10,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6000 states and 7475 transitions. [2022-01-10 02:40:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2022-01-10 02:40:10,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:10,927 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 13, 11, 11, 10, 10, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:10,937 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 02:40:11,134 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 02:40:11,135 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash -11427445, now seen corresponding path program 1 times [2022-01-10 02:40:11,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:11,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587565979] [2022-01-10 02:40:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:11,136 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:11,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:11,137 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 02:40:11,138 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 02:40:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:11,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:11,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 1023 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2022-01-10 02:40:11,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:11,691 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:11,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587565979] [2022-01-10 02:40:11,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587565979] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:11,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:11,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:11,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063306004] [2022-01-10 02:40:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:11,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:11,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:11,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:11,692 INFO L87 Difference]: Start difference. First operand 6000 states and 7475 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 02:40:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:11,749 INFO L93 Difference]: Finished difference Result 8543 states and 10626 transitions. [2022-01-10 02:40:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:11,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 395 [2022-01-10 02:40:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:11,758 INFO L225 Difference]: With dead ends: 8543 [2022-01-10 02:40:11,758 INFO L226 Difference]: Without dead ends: 6002 [2022-01-10 02:40:11,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 393 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 02:40:11,762 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 73 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:11,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 435 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2022-01-10 02:40:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 6000. [2022-01-10 02:40:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6000 states, 5999 states have (on average 1.2430405067511252) internal successors, (7457), 5999 states have internal predecessors, (7457), 0 states have call successors, (0), 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 02:40:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6000 states to 6000 states and 7457 transitions. [2022-01-10 02:40:11,828 INFO L78 Accepts]: Start accepts. Automaton has 6000 states and 7457 transitions. Word has length 395 [2022-01-10 02:40:11,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:11,828 INFO L470 AbstractCegarLoop]: Abstraction has 6000 states and 7457 transitions. [2022-01-10 02:40:11,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 02:40:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 6000 states and 7457 transitions. [2022-01-10 02:40:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2022-01-10 02:40:11,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:11,834 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:11,841 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 02:40:12,041 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 02:40:12,041 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:12,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1233330663, now seen corresponding path program 1 times [2022-01-10 02:40:12,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:12,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581272661] [2022-01-10 02:40:12,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:12,042 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:12,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:12,043 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 02:40:12,043 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 02:40:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:12,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:12,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2022-01-10 02:40:12,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:12,475 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:12,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581272661] [2022-01-10 02:40:12,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581272661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:12,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:12,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:12,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96031192] [2022-01-10 02:40:12,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:12,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:12,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:12,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:12,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:12,477 INFO L87 Difference]: Start difference. First operand 6000 states and 7457 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 02:40:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:12,619 INFO L93 Difference]: Finished difference Result 10921 states and 13771 transitions. [2022-01-10 02:40:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:12,619 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 396 [2022-01-10 02:40:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:12,623 INFO L225 Difference]: With dead ends: 10921 [2022-01-10 02:40:12,623 INFO L226 Difference]: Without dead ends: 3351 [2022-01-10 02:40:12,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 394 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 02:40:12,628 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:12,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 258 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2022-01-10 02:40:12,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3349. [2022-01-10 02:40:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3349 states, 3348 states have (on average 1.2434289127837514) internal successors, (4163), 3348 states have internal predecessors, (4163), 0 states have call successors, (0), 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 02:40:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 4163 transitions. [2022-01-10 02:40:12,664 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 4163 transitions. Word has length 396 [2022-01-10 02:40:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:12,664 INFO L470 AbstractCegarLoop]: Abstraction has 3349 states and 4163 transitions. [2022-01-10 02:40:12,664 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 02:40:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 4163 transitions. [2022-01-10 02:40:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2022-01-10 02:40:12,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:12,669 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:12,695 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 02:40:12,876 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 02:40:12,877 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1723660819, now seen corresponding path program 1 times [2022-01-10 02:40:12,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:12,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977295406] [2022-01-10 02:40:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:12,878 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:12,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:12,879 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 02:40:12,880 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 02:40:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:12,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:12,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2022-01-10 02:40:13,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2022-01-10 02:40:14,169 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:14,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977295406] [2022-01-10 02:40:14,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977295406] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:14,170 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:14,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:40:14,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484220525] [2022-01-10 02:40:14,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:14,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:40:14,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:14,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:40:14,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:40:14,171 INFO L87 Difference]: Start difference. First operand 3349 states and 4163 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 02:40:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:14,322 INFO L93 Difference]: Finished difference Result 3562 states and 4433 transitions. [2022-01-10 02:40:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:14,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 619 [2022-01-10 02:40:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:14,323 INFO L225 Difference]: With dead ends: 3562 [2022-01-10 02:40:14,323 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 02:40:14,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1234 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:40:14,325 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 132 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:14,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 201 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 02:40:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 02:40:14,326 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 02:40:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 02:40:14,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 619 [2022-01-10 02:40:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:14,326 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 02:40:14,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 02:40:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 02:40:14,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 02:40:14,328 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 02:40:14,336 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 02:40:14,535 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 02:40:14,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L498(lines 498 503) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L465(lines 465 476) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L465-1(lines 465 476) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L333-2(lines 207 539) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 404) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 543) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 554) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 565) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L103-1(lines 75 624) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L467(lines 467 473) no Hoare annotation was computed. [2022-01-10 02:40:16,055 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 306) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L302-2(lines 302 306) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L861 garLoopResultBuilder]: At program point L203(lines 202 543) the Hoare annotation is: true [2022-01-10 02:40:16,056 INFO L854 garLoopResultBuilder]: At program point L137(lines 133 566) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32)))) [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 274) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 242) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L270-2(lines 207 539) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L861 garLoopResultBuilder]: At program point L634(lines 626 636) the Hoare annotation is: true [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 553) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 564) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 575) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L437(lines 437 441) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L858 garLoopResultBuilder]: For program point L437-2(lines 207 539) no Hoare annotation was computed. [2022-01-10 02:40:16,056 INFO L861 garLoopResultBuilder]: At program point L206(lines 205 542) the Hoare annotation is: true [2022-01-10 02:40:16,056 INFO L854 garLoopResultBuilder]: At program point L173(lines 169 554) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse3 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2 .cse3))) [2022-01-10 02:40:16,057 INFO L854 garLoopResultBuilder]: At program point L107(lines 106 575) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv0 32)) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv12292 32))) [2022-01-10 02:40:16,057 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2022-01-10 02:40:16,057 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 411) no Hoare annotation was computed. [2022-01-10 02:40:16,057 INFO L858 garLoopResultBuilder]: For program point L406-2(lines 406 411) no Hoare annotation was computed. [2022-01-10 02:40:16,057 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 552) no Hoare annotation was computed. [2022-01-10 02:40:16,057 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 563) no Hoare annotation was computed. [2022-01-10 02:40:16,057 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 574) no Hoare annotation was computed. [2022-01-10 02:40:16,057 INFO L854 garLoopResultBuilder]: At program point L143(lines 139 564) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))))) (or (and .cse0 (= (_ bv3 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2) (and .cse0 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2))) [2022-01-10 02:40:16,058 INFO L854 garLoopResultBuilder]: At program point L540(lines 103 606) the Hoare annotation is: (let ((.cse3 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|))) (let ((.cse15 (= (_ bv4480 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse14 (= (_ bv4432 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse10 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4368 32)))) (.cse12 (= (_ bv4464 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4416 32))) (.cse8 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv3 32))) (.cse17 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4560 32))) (.cse11 (= (_ bv4528 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse18 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4448 32))) (.cse7 (not .cse3)) (.cse13 (= (_ bv4512 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse0 (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse16 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4496 32))) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4560 32))) (.cse2 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse9 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse5 (= (_ bv4352 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 (= (_ bv3 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse4) (and .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse11 .cse4) (and .cse3 .cse9 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) (and .cse2 .cse3 .cse9 .cse4 .cse12) (and .cse2 .cse13 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse4 .cse14) (and .cse2 .cse11 .cse9 .cse4) (and .cse2 .cse3 .cse15 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse15 .cse4) (and .cse1 .cse2 .cse8 .cse9 .cse4) (and .cse2 .cse3 .cse9 .cse4 .cse14) (and .cse2 .cse3 .cse16 .cse9 .cse4) (and .cse7 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse17 .cse9) (and .cse0 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse2 .cse3 .cse4 .cse12) (and .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4) (and .cse7 (= (_ bv3 32) |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse9 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse4) (and .cse1 .cse2 .cse17 .cse9 .cse4) (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv0 32)) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))) (and .cse7 .cse11 .cse9) (and .cse2 .cse18 .cse3 .cse9 .cse4) (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv1 32)) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))) (and .cse0 .cse2 .cse18 .cse3 .cse4) (and .cse7 .cse13 .cse9) (and .cse0 .cse2 .cse3 .cse16 .cse4) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5)))) [2022-01-10 02:40:16,058 INFO L861 garLoopResultBuilder]: At program point L607(lines 102 608) the Hoare annotation is: true [2022-01-10 02:40:16,058 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 551) no Hoare annotation was computed. [2022-01-10 02:40:16,058 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 562) no Hoare annotation was computed. [2022-01-10 02:40:16,058 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 573) no Hoare annotation was computed. [2022-01-10 02:40:16,058 INFO L858 garLoopResultBuilder]: For program point L377(lines 377 381) no Hoare annotation was computed. [2022-01-10 02:40:16,058 INFO L858 garLoopResultBuilder]: For program point L377-2(lines 377 381) no Hoare annotation was computed. [2022-01-10 02:40:16,058 INFO L858 garLoopResultBuilder]: For program point L311-1(lines 311 325) no Hoare annotation was computed. [2022-01-10 02:40:16,058 INFO L854 garLoopResultBuilder]: At program point L212(lines 109 574) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32)))) [2022-01-10 02:40:16,063 INFO L854 garLoopResultBuilder]: At program point L179(lines 175 552) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse3 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2 .cse3))) [2022-01-10 02:40:16,063 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 604) no Hoare annotation was computed. [2022-01-10 02:40:16,063 INFO L858 garLoopResultBuilder]: For program point L577(lines 577 601) no Hoare annotation was computed. [2022-01-10 02:40:16,063 INFO L858 garLoopResultBuilder]: For program point L511-1(lines 207 539) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L346(lines 346 351) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 550) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 561) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 572) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L611(lines 611 615) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L578(lines 578 587) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L611-2(lines 611 615) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L578-2(lines 577 599) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L854 garLoopResultBuilder]: At program point L149(lines 145 562) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse3 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2 .cse3))) [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-01-10 02:40:16,064 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 313 325) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L580(lines 580 584) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L448(lines 448 453) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 287) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L217(lines 217 221) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 549) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 560) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L217-2(lines 207 539) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 571) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L482(lines 482 486) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L854 garLoopResultBuilder]: At program point L185(lines 181 550) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse4 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3) (and (not .cse1) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) .cse4 .cse3))) [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L516-1(lines 516 520) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 258) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 548) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 559) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 570) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L854 garLoopResultBuilder]: At program point L155(lines 151 560) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse3 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2 .cse3))) [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L487(lines 487 491) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point L487-2(lines 487 491) no Hoare annotation was computed. [2022-01-10 02:40:16,065 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 547) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 558) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 569) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L389(lines 389 393) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L356(lines 356 360) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L854 garLoopResultBuilder]: At program point L191(lines 187 548) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse4 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3) (and (not .cse1) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) .cse4 .cse3))) [2022-01-10 02:40:16,066 INFO L854 garLoopResultBuilder]: At program point L125(lines 121 570) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32)))) [2022-01-10 02:40:16,066 INFO L854 garLoopResultBuilder]: At program point L357(lines 75 624) the Hoare annotation is: false [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L861 garLoopResultBuilder]: At program point L622(lines 75 624) the Hoare annotation is: true [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L589(lines 589 595) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L523-2(lines 523 527) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L292(lines 292 296) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L292-2(lines 207 539) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 546) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 557) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 568) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L861 garLoopResultBuilder]: At program point L623(lines 18 625) the Hoare annotation is: true [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 462) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 365) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L229(lines 229 246) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 545) no Hoare annotation was computed. [2022-01-10 02:40:16,066 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 556) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L229-2(lines 207 539) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 567) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L854 garLoopResultBuilder]: At program point L197(lines 193 546) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4560 32))) (.cse5 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse3 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse6 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))))) (or (and (let ((.cse0 (not .cse3))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4368 32))) .cse2) (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4560 32)) .cse1))) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32)))) (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse4 .cse5 .cse3 .cse6 .cse2) (and .cse4 .cse5 .cse3 .cse1 .cse6 .cse2))) [2022-01-10 02:40:16,067 INFO L854 garLoopResultBuilder]: At program point L131(lines 127 568) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv1 32)) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32)))) [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L495-1(lines 495 507) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L429(lines 429 433) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 544) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 555) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 566) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L858 garLoopResultBuilder]: For program point L530(lines 530 534) no Hoare annotation was computed. [2022-01-10 02:40:16,067 INFO L854 garLoopResultBuilder]: At program point L200(lines 199 544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4560 32))) (.cse1 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse5 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse4 (= (_ bv4352 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse2) (= (_ bv3 32) |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse5 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse4))) [2022-01-10 02:40:16,067 INFO L854 garLoopResultBuilder]: At program point L167(lines 157 558) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| (_ bv65535 32))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| (_ bv61087 32))) (.cse3 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2 .cse3))) [2022-01-10 02:40:16,070 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] [2022-01-10 02:40:16,071 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:40:16,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:40:16 BoogieIcfgContainer [2022-01-10 02:40:16,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:40:16,095 INFO L158 Benchmark]: Toolchain (without parser) took 19789.82ms. Allocated memory was 174.1MB in the beginning and 304.1MB in the end (delta: 130.0MB). Free memory was 114.8MB in the beginning and 117.0MB in the end (delta: -2.3MB). Peak memory consumption was 172.2MB. Max. memory is 8.0GB. [2022-01-10 02:40:16,095 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:40:16,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.51ms. Allocated memory was 174.1MB in the beginning and 252.7MB in the end (delta: 78.6MB). Free memory was 114.6MB in the beginning and 220.3MB in the end (delta: -105.7MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-01-10 02:40:16,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.11ms. Allocated memory is still 252.7MB. Free memory was 220.3MB in the beginning and 218.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:40:16,095 INFO L158 Benchmark]: Boogie Preprocessor took 30.19ms. Allocated memory is still 252.7MB. Free memory was 217.7MB in the beginning and 216.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 02:40:16,096 INFO L158 Benchmark]: RCFGBuilder took 408.32ms. Allocated memory is still 252.7MB. Free memory was 216.1MB in the beginning and 190.4MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-01-10 02:40:16,096 INFO L158 Benchmark]: TraceAbstraction took 19046.09ms. Allocated memory was 252.7MB in the beginning and 304.1MB in the end (delta: 51.4MB). Free memory was 189.9MB in the beginning and 117.0MB in the end (delta: 72.8MB). Peak memory consumption was 168.8MB. Max. memory is 8.0GB. [2022-01-10 02:40:16,096 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.11ms. Allocated memory is still 174.1MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.51ms. Allocated memory was 174.1MB in the beginning and 252.7MB in the end (delta: 78.6MB). Free memory was 114.6MB in the beginning and 220.3MB in the end (delta: -105.7MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.11ms. Allocated memory is still 252.7MB. Free memory was 220.3MB in the beginning and 218.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.19ms. Allocated memory is still 252.7MB. Free memory was 217.7MB in the beginning and 216.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 408.32ms. Allocated memory is still 252.7MB. Free memory was 216.1MB in the beginning and 190.4MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 19046.09ms. Allocated memory was 252.7MB in the beginning and 304.1MB in the end (delta: 51.4MB). Free memory was 189.9MB in the beginning and 117.0MB in the end (delta: 72.8MB). Peak memory consumption was 168.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: 618]: 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, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 25, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2033 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2033 mSDsluCounter, 8427 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3465 mSDsCounter, 448 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3047 IncrementalHoareTripleChecker+Invalid, 3495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 448 mSolverCounterUnsat, 4962 mSDtfsCounter, 3047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6275 GetRequests, 6230 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6000occurred in iteration=22, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2071 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 118 NumberOfFragments, 944 HoareAnnotationTreeSize, 23 FomulaSimplifications, 548 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 2651 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 5115 NumberOfCodeBlocks, 5115 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 6257 ConstructedInterpolants, 0 QuantifiedInterpolants, 8389 SizeOfPredicates, 4 NumberOfNonLiveVariables, 6334 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 25610/25714 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: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 && !(s__state == 4400bv32) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((4bv32 == blastFlag && s__s3__tmp__next_state___0 == 4560bv32) && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && 4352bv32 == s__state) || (((!(0bv32 == s__hit) && 3bv32 == s__s3__tmp__next_state___0) && 2bv32 == blastFlag) && 4352bv32 == s__state)) || (((((s__s3__tmp__next_state___0 == 4560bv32 && ag_X == 65535bv32) && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && 4352bv32 == s__state) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (blastFlag == 0bv32 && !(s__state == 4400bv32)) && !(s__state == 4368bv32) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == s__hit) && 2bv32 == blastFlag) && !(s__s3__tmp__next_state___0 == 4368bv32)) && !(s__state == 4368bv32)) || ((!(0bv32 == s__hit) && s__state == 4560bv32) && 2bv32 == blastFlag)) && !(s__state == 4400bv32)) || (((((4bv32 == blastFlag && s__s3__tmp__next_state___0 == 4560bv32) && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && !(s__state == 4368bv32))) || (((((s__s3__tmp__next_state___0 == 4560bv32 && ag_X == 65535bv32) && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 && s__state == 12292bv32 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((4bv32 == blastFlag && s__s3__tmp__next_state___0 == 4560bv32) && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && 4352bv32 == s__state) || (((s__state == 4416bv32 && 0bv32 == s__hit) && 3bv32 == blastFlag) && ag_Y == 61087bv32)) || (((!(0bv32 == s__hit) && s__state == 3bv32) && 2bv32 == blastFlag) && !(s__s3__tmp__next_state___0 == 4368bv32))) || ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && 4528bv32 == s__state) && ag_Y == 61087bv32)) || ((0bv32 == s__hit && 2bv32 == blastFlag) && s__state == 4400bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && 4464bv32 == s__state)) || (((ag_X == 65535bv32 && 4512bv32 == s__state) && 2bv32 == blastFlag) && ag_Y == 61087bv32)) || ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && 4432bv32 == s__state)) || (((ag_X == 65535bv32 && 4528bv32 == s__state) && 2bv32 == blastFlag) && ag_Y == 61087bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 4480bv32 == s__state) && 2bv32 == blastFlag) && ag_Y == 61087bv32)) || ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && 4480bv32 == s__state) && ag_Y == 61087bv32)) || ((((s__s3__tmp__next_state___0 == 4560bv32 && ag_X == 65535bv32) && s__state == 3bv32) && 2bv32 == blastFlag) && ag_Y == 61087bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && 4432bv32 == s__state)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && s__state == 4496bv32) && 2bv32 == blastFlag) && ag_Y == 61087bv32)) || ((((!(0bv32 == s__hit) && ag_X == 65535bv32) && s__state == 3bv32) && ag_Y == 61087bv32) && !(s__s3__tmp__next_state___0 == 4368bv32))) || ((!(0bv32 == s__hit) && s__state == 4560bv32) && 2bv32 == blastFlag)) || ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && 4512bv32 == s__state) && ag_Y == 61087bv32)) || ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && 4464bv32 == s__state)) || (((s__state == 4416bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32)) || (((((4bv32 == blastFlag && s__s3__tmp__next_state___0 == 4560bv32) && ag_X == 65535bv32) && 0bv32 == s__hit) && s__state == 4560bv32) && ag_Y == 61087bv32)) || (((!(0bv32 == s__hit) && 3bv32 == s__s3__tmp__next_state___0) && 2bv32 == blastFlag) && 4352bv32 == s__state)) || ((((4bv32 == blastFlag && s__s3__tmp__next_state___0 == 4560bv32) && ag_X == 65535bv32) && s__state == 3bv32) && ag_Y == 61087bv32)) || ((((s__s3__tmp__next_state___0 == 4560bv32 && ag_X == 65535bv32) && s__state == 4560bv32) && 2bv32 == blastFlag) && ag_Y == 61087bv32)) || (blastFlag == 0bv32 && s__state == 4368bv32)) || ((!(0bv32 == s__hit) && 4528bv32 == s__state) && 2bv32 == blastFlag)) || ((((ag_X == 65535bv32 && s__state == 4448bv32) && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32)) || (blastFlag == 1bv32 && s__state == 4384bv32)) || ((((4bv32 == blastFlag && ag_X == 65535bv32) && s__state == 4448bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32)) || ((!(0bv32 == s__hit) && 4512bv32 == s__state) && 2bv32 == blastFlag)) || ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && s__state == 4496bv32) && ag_Y == 61087bv32)) || (((((s__s3__tmp__next_state___0 == 4560bv32 && ag_X == 65535bv32) && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && 4352bv32 == s__state) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (blastFlag == 1bv32 && !(s__state == 4400bv32)) && !(s__state == 4368bv32) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (0bv32 == s__hit && 2bv32 == blastFlag) && !(s__state == 4368bv32) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32))) || (((!(0bv32 == s__hit) && !(s__state == 4400bv32)) && 2bv32 == blastFlag) && !(s__state == 4368bv32)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32))) || (((!(0bv32 == s__hit) && !(s__state == 4400bv32)) && 2bv32 == blastFlag) && !(s__state == 4368bv32)) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((0bv32 == s__hit && 3bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) || (((0bv32 == s__hit && 2bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((((4bv32 == blastFlag && ag_X == 65535bv32) && 0bv32 == s__hit) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) || ((((ag_X == 65535bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag) && ag_Y == 61087bv32) && !(s__state == 4368bv32)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 02:40:16,136 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...