java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:37:39,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:37:39,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:37:39,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:37:39,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:37:39,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:37:39,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:37:39,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:37:39,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:37:39,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:37:39,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:37:39,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:37:39,034 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:37:39,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:37:39,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:37:39,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:37:39,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:37:39,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:37:39,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:37:39,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:37:39,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:37:39,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:37:39,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:37:39,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:37:39,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:37:39,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:37:39,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:37:39,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:37:39,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:37:39,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:37:39,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:37:39,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:37:39,059 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:37:39,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:37:39,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:37:39,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:37:39,063 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:37:39,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:37:39,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:37:39,096 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:37:39,096 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:37:39,096 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:37:39,096 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:37:39,096 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:37:39,097 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:37:39,098 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:37:39,098 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:37:39,098 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:37:39,098 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:37:39,099 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:37:39,099 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:37:39,100 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:37:39,100 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:37:39,100 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:37:39,100 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:37:39,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:37:39,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:37:39,101 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:37:39,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:37:39,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:37:39,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:37:39,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:37:39,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:37:39,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:37:39,104 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:37:39,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:37:39,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:37:39,104 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:37:39,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:37:39,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:37:39,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:37:39,106 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:37:39,107 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:37:39,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:37:39,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:37:39,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:37:39,196 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:37:39,196 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:37:39,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-07 10:37:39,254 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4099dd1d/5b9e2aa5b70440e78bf62d919a57c4b1/FLAG24c18acef [2018-11-07 10:37:39,693 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:37:39,694 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-07 10:37:39,702 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4099dd1d/5b9e2aa5b70440e78bf62d919a57c4b1/FLAG24c18acef [2018-11-07 10:37:39,715 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4099dd1d/5b9e2aa5b70440e78bf62d919a57c4b1 [2018-11-07 10:37:39,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:37:39,728 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:37:39,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:37:39,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:37:39,733 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:37:39,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:39" (1/1) ... [2018-11-07 10:37:39,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a12b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:39, skipping insertion in model container [2018-11-07 10:37:39,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:39" (1/1) ... [2018-11-07 10:37:39,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:37:39,781 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:37:40,014 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:37:40,018 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:37:40,055 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:37:40,069 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:37:40,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40 WrapperNode [2018-11-07 10:37:40,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:37:40,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:37:40,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:37:40,070 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:37:40,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... [2018-11-07 10:37:40,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... [2018-11-07 10:37:40,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:37:40,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:37:40,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:37:40,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:37:40,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... [2018-11-07 10:37:40,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... [2018-11-07 10:37:40,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... [2018-11-07 10:37:40,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... [2018-11-07 10:37:40,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... [2018-11-07 10:37:40,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... [2018-11-07 10:37:40,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... [2018-11-07 10:37:40,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:37:40,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:37:40,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:37:40,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:37:40,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:37:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:37:40,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:37:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:37:40,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:37:40,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:37:40,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:37:40,811 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:37:40,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:40 BoogieIcfgContainer [2018-11-07 10:37:40,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:37:40,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:37:40,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:37:40,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:37:40,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:37:39" (1/3) ... [2018-11-07 10:37:40,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ac093c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:40, skipping insertion in model container [2018-11-07 10:37:40,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:40" (2/3) ... [2018-11-07 10:37:40,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ac093c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:40, skipping insertion in model container [2018-11-07 10:37:40,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:40" (3/3) ... [2018-11-07 10:37:40,820 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-07 10:37:40,829 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:37:40,837 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-07 10:37:40,854 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-07 10:37:40,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:37:40,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:37:40,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:37:40,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:37:40,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:37:40,889 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:37:40,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:37:40,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:37:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-07 10:37:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 10:37:40,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:40,926 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:40,932 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:40,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:40,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2018-11-07 10:37:40,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:40,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:40,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:40,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:40,987 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:41,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:41,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:37:41,103 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:41,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:37:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:37:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:37:41,121 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-11-07 10:37:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:41,169 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2018-11-07 10:37:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:37:41,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-07 10:37:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:41,183 INFO L225 Difference]: With dead ends: 88 [2018-11-07 10:37:41,183 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 10:37:41,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:37:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 10:37:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-07 10:37:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 10:37:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-07 10:37:41,235 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2018-11-07 10:37:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:41,236 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-07 10:37:41,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:37:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-07 10:37:41,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:37:41,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:41,237 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:41,238 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:41,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2018-11-07 10:37:41,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:41,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:41,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:41,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:41,240 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:41,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:41,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:37:41,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:41,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:37:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:37:41,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:37:41,406 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2018-11-07 10:37:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:41,839 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-11-07 10:37:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:37:41,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 10:37:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:41,841 INFO L225 Difference]: With dead ends: 153 [2018-11-07 10:37:41,841 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 10:37:41,843 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 10:37:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2018-11-07 10:37:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 10:37:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-07 10:37:41,852 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2018-11-07 10:37:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:41,853 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-07 10:37:41,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:37:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-07 10:37:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:37:41,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:41,854 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:41,855 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:41,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2018-11-07 10:37:41,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:41,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:41,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:41,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:41,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:41,950 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:41,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:41,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:41,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:41,951 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2018-11-07 10:37:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:42,192 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-07 10:37:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:37:42,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-07 10:37:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:42,195 INFO L225 Difference]: With dead ends: 75 [2018-11-07 10:37:42,196 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 10:37:42,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 10:37:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-11-07 10:37:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 10:37:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-07 10:37:42,211 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2018-11-07 10:37:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:42,212 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-07 10:37:42,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-07 10:37:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:37:42,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:42,218 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:42,218 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:42,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:42,219 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2018-11-07 10:37:42,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:42,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:42,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:42,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:42,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:37:42,341 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:42,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:37:42,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:37:42,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:42,342 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-11-07 10:37:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:42,703 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-07 10:37:42,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:37:42,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 10:37:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:42,705 INFO L225 Difference]: With dead ends: 98 [2018-11-07 10:37:42,705 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 10:37:42,706 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:37:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 10:37:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 54. [2018-11-07 10:37:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 10:37:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 10:37:42,714 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2018-11-07 10:37:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:42,715 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 10:37:42,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:37:42,715 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 10:37:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 10:37:42,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:42,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:42,717 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:42,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:42,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2018-11-07 10:37:42,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:42,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:42,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:42,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:42,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:43,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:43,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 10:37:43,042 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:43,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:37:43,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:37:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:37:43,043 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-11-07 10:37:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:43,688 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-07 10:37:43,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:37:43,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-07 10:37:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:43,690 INFO L225 Difference]: With dead ends: 97 [2018-11-07 10:37:43,690 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 10:37:43,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:37:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 10:37:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2018-11-07 10:37:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 10:37:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-07 10:37:43,701 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-11-07 10:37:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:43,701 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-07 10:37:43,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:37:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-07 10:37:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 10:37:43,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:43,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:43,703 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:43,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2018-11-07 10:37:43,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:43,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:43,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:43,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:43,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:43,863 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:43,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:43,864 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-11-07 10:37:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:44,006 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-11-07 10:37:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:37:44,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-07 10:37:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:44,009 INFO L225 Difference]: With dead ends: 83 [2018-11-07 10:37:44,009 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 10:37:44,010 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:37:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 10:37:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2018-11-07 10:37:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 10:37:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 10:37:44,018 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-11-07 10:37:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:44,018 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 10:37:44,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 10:37:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:37:44,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:44,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:44,020 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:44,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2018-11-07 10:37:44,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:44,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:44,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:44,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:44,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:44,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:44,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:37:44,107 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:44,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:37:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:37:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:44,109 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-11-07 10:37:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:44,441 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-07 10:37:44,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:37:44,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 10:37:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:44,443 INFO L225 Difference]: With dead ends: 93 [2018-11-07 10:37:44,443 INFO L226 Difference]: Without dead ends: 91 [2018-11-07 10:37:44,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:37:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-07 10:37:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 48. [2018-11-07 10:37:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:37:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-07 10:37:44,453 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2018-11-07 10:37:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:44,453 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-07 10:37:44,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:37:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-07 10:37:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:37:44,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:44,454 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:44,455 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:44,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2018-11-07 10:37:44,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:44,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:44,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:44,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:44,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:44,526 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:44,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:44,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:44,528 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2018-11-07 10:37:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:44,720 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-07 10:37:44,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:37:44,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 10:37:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:44,722 INFO L225 Difference]: With dead ends: 73 [2018-11-07 10:37:44,723 INFO L226 Difference]: Without dead ends: 71 [2018-11-07 10:37:44,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:37:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-07 10:37:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2018-11-07 10:37:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 10:37:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-07 10:37:44,732 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2018-11-07 10:37:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:44,732 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-07 10:37:44,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-07 10:37:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 10:37:44,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:44,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:44,734 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:44,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:44,735 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2018-11-07 10:37:44,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:44,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:44,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:44,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:44,736 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:44,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:44,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:37:44,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:44,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:37:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:37:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:44,832 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-11-07 10:37:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:45,033 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-07 10:37:45,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:37:45,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-07 10:37:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:45,035 INFO L225 Difference]: With dead ends: 71 [2018-11-07 10:37:45,035 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 10:37:45,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:37:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 10:37:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 44. [2018-11-07 10:37:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 10:37:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-07 10:37:45,044 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2018-11-07 10:37:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:45,044 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-07 10:37:45,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:37:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-07 10:37:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:37:45,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:45,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:45,046 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:45,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2018-11-07 10:37:45,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:45,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:45,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,048 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:45,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:45,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:45,137 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:45,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:45,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:45,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:45,138 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-11-07 10:37:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:45,261 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-07 10:37:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:37:45,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 10:37:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:45,263 INFO L225 Difference]: With dead ends: 71 [2018-11-07 10:37:45,263 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 10:37:45,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 10:37:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2018-11-07 10:37:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 10:37:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-07 10:37:45,272 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-11-07 10:37:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:45,273 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-07 10:37:45,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-07 10:37:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:37:45,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:45,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:45,275 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:45,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2018-11-07 10:37:45,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,277 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:45,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:45,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:45,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:45,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:45,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:45,344 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-11-07 10:37:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:45,519 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-07 10:37:45,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:37:45,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-07 10:37:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:45,521 INFO L225 Difference]: With dead ends: 69 [2018-11-07 10:37:45,522 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 10:37:45,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 10:37:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2018-11-07 10:37:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 10:37:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-07 10:37:45,531 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2018-11-07 10:37:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:45,531 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-07 10:37:45,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-07 10:37:45,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 10:37:45,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:45,532 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:45,533 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:45,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2018-11-07 10:37:45,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:45,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:45,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:37:45,612 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:45,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:37:45,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:37:45,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:45,613 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-11-07 10:37:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:45,799 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-11-07 10:37:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:37:45,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 10:37:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:45,800 INFO L225 Difference]: With dead ends: 89 [2018-11-07 10:37:45,800 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 10:37:45,801 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:37:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 10:37:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 38. [2018-11-07 10:37:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 10:37:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-07 10:37:45,808 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2018-11-07 10:37:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:45,808 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-07 10:37:45,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:37:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-07 10:37:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 10:37:45,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:45,810 INFO L375 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] [2018-11-07 10:37:45,810 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:45,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2018-11-07 10:37:45,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:45,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:45,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,812 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:45,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:45,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:37:45,903 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:45,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:37:45,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:37:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:37:45,904 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-11-07 10:37:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:46,672 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-07 10:37:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:37:46,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-07 10:37:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:46,674 INFO L225 Difference]: With dead ends: 72 [2018-11-07 10:37:46,675 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 10:37:46,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:37:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 10:37:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 36. [2018-11-07 10:37:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 10:37:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-07 10:37:46,682 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-11-07 10:37:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:46,683 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-07 10:37:46,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:37:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-07 10:37:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:37:46,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:46,684 INFO L375 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] [2018-11-07 10:37:46,685 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:46,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2018-11-07 10:37:46,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:46,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:46,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:47,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:47,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:37:47,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:47,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:37:47,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:37:47,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:47,036 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-11-07 10:37:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:47,501 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-11-07 10:37:47,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:37:47,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-07 10:37:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:47,503 INFO L225 Difference]: With dead ends: 105 [2018-11-07 10:37:47,503 INFO L226 Difference]: Without dead ends: 103 [2018-11-07 10:37:47,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:37:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-07 10:37:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 34. [2018-11-07 10:37:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 10:37:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-07 10:37:47,512 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2018-11-07 10:37:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:47,512 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-07 10:37:47,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:37:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-07 10:37:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 10:37:47,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:47,513 INFO L375 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] [2018-11-07 10:37:47,514 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:47,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2018-11-07 10:37:47,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:47,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:47,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:47,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:47,516 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:47,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:47,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:37:47,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:47,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:37:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:37:47,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:37:47,629 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-11-07 10:37:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:48,247 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-07 10:37:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:37:48,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-07 10:37:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:48,249 INFO L225 Difference]: With dead ends: 70 [2018-11-07 10:37:48,250 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 10:37:48,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:37:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 10:37:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 32. [2018-11-07 10:37:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 10:37:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-07 10:37:48,259 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2018-11-07 10:37:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:48,260 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-07 10:37:48,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:37:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-07 10:37:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 10:37:48,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:48,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:48,262 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:48,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:48,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2018-11-07 10:37:48,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:48,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:48,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:48,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:48,264 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:48,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:48,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:37:48,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:48,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:37:48,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:37:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:48,370 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-11-07 10:37:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:48,662 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-07 10:37:48,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:37:48,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-07 10:37:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:48,663 INFO L225 Difference]: With dead ends: 85 [2018-11-07 10:37:48,663 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:37:48,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:37:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:37:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:37:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:37:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:37:48,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-07 10:37:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:48,665 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:37:48,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:37:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:37:48,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:37:48,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 10:37:48,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:37:48,877 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 63 [2018-11-07 10:37:48,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:37:49,035 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 94 [2018-11-07 10:37:49,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:37:49,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:37:49,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:37:49,217 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 86 [2018-11-07 10:37:50,073 WARN L179 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-07 10:37:50,879 WARN L179 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2018-11-07 10:37:51,465 WARN L179 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 18 [2018-11-07 10:37:51,469 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:37:51,469 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:37:51,469 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:37:51,469 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:37:51,470 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 10:37:51,470 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:37:51,470 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:37:51,470 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2018-11-07 10:37:51,470 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2018-11-07 10:37:51,470 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2018-11-07 10:37:51,470 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2018-11-07 10:37:51,470 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2018-11-07 10:37:51,470 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2018-11-07 10:37:51,471 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-11-07 10:37:51,471 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2018-11-07 10:37:51,472 INFO L421 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse0 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) (.cse1 (and (<= 1 main_~main__j~0) (let ((.cse3 (<= 1 main_~main__i~0))) (or (and .cse3 (not (= 0 main_~__VERIFIER_assert__cond~12))) (and .cse3 .cse2)))))) (or (and .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~14))) (and (and .cse0 (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))) (<= 0 main_~main__j~0)) (and .cse0 .cse1 .cse2)))) [2018-11-07 10:37:51,472 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 10:37:51,472 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-11-07 10:37:51,472 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2018-11-07 10:37:51,472 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2018-11-07 10:37:51,472 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-11-07 10:37:51,473 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2018-11-07 10:37:51,474 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-07 10:37:51,474 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2018-11-07 10:37:51,474 INFO L425 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-07 10:37:51,474 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2018-11-07 10:37:51,474 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2018-11-07 10:37:51,474 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2018-11-07 10:37:51,474 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2018-11-07 10:37:51,474 INFO L425 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-11-07 10:37:51,474 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2018-11-07 10:37:51,475 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2018-11-07 10:37:51,475 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2018-11-07 10:37:51,475 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2018-11-07 10:37:51,475 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 10:37:51,475 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2018-11-07 10:37:51,475 INFO L421 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__j~0)) [2018-11-07 10:37:51,475 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2018-11-07 10:37:51,476 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2018-11-07 10:37:51,476 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 10:37:51,476 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2018-11-07 10:37:51,476 INFO L425 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-07 10:37:51,476 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2018-11-07 10:37:51,476 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2018-11-07 10:37:51,476 INFO L425 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-07 10:37:51,477 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2018-11-07 10:37:51,477 INFO L425 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-07 10:37:51,477 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2018-11-07 10:37:51,477 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-07 10:37:51,477 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2018-11-07 10:37:51,477 INFO L425 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-07 10:37:51,477 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2018-11-07 10:37:51,478 INFO L421 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2018-11-07 10:37:51,478 INFO L425 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-07 10:37:51,478 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2018-11-07 10:37:51,478 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2018-11-07 10:37:51,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:37:51 BoogieIcfgContainer [2018-11-07 10:37:51,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:37:51,497 INFO L168 Benchmark]: Toolchain (without parser) took 11770.30 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -843.4 MB). Peak memory consumption was 587.8 MB. Max. memory is 7.1 GB. [2018-11-07 10:37:51,498 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:37:51,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:37:51,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:37:51,500 INFO L168 Benchmark]: Boogie Preprocessor took 26.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:37:51,501 INFO L168 Benchmark]: RCFGBuilder took 694.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:37:51,502 INFO L168 Benchmark]: TraceAbstraction took 10683.33 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -95.1 MB). Peak memory consumption was 604.2 MB. Max. memory is 7.1 GB. [2018-11-07 10:37:51,506 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 340.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 21.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 694.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10683.33 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -95.1 MB). Peak memory consumption was 604.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && !(0 == __VERIFIER_assert__cond)) || ((main__limit + 4 <= main__bufsize && main__i < main__len && 0 <= main__i) && 0 <= main__j)) || ((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 10.6s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 917 SDtfs, 1559 SDslu, 1120 SDs, 0 SdLazy, 1186 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 528 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 23 NumberOfFragments, 118 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1474945965 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1237784 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 14171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...