java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:52:06,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:52:06,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:52:06,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:52:06,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:52:06,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:52:06,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:52:06,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:52:06,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:52:06,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:52:06,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:52:06,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:52:06,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:52:06,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:52:06,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:52:06,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:52:06,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:52:06,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:52:06,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:52:06,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:52:06,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:52:06,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:52:06,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:52:06,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:52:06,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:52:06,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:52:06,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:52:06,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:52:06,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:52:06,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:52:06,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:52:06,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:52:06,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:52:06,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:52:06,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:52:06,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:52:06,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:52:06,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:52:06,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:52:06,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:52:06,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:52:06,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:52:06,101 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:52:06,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:52:06,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:52:06,102 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:52:06,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:52:06,103 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:52:06,104 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:52:06,104 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:52:06,104 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:52:06,104 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:52:06,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:52:06,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:52:06,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:52:06,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:52:06,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:52:06,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:52:06,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:52:06,108 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:52:06,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:52:06,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:52:06,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:52:06,109 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:52:06,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:52:06,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:06,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:52:06,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:52:06,110 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:52:06,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:52:06,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:52:06,111 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:52:06,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:52:06,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:52:06,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:52:06,165 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:52:06,165 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:52:06,166 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-03 20:52:06,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1f9e529/24431cee7e1a48f7a4bca12e6be186ff/FLAG76a9aa791 [2019-09-03 20:52:06,618 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:52:06,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-03 20:52:06,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1f9e529/24431cee7e1a48f7a4bca12e6be186ff/FLAG76a9aa791 [2019-09-03 20:52:07,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1f9e529/24431cee7e1a48f7a4bca12e6be186ff [2019-09-03 20:52:07,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:52:07,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:52:07,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:07,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:52:07,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:52:07,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:07" (1/1) ... [2019-09-03 20:52:07,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c569d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07, skipping insertion in model container [2019-09-03 20:52:07,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:07" (1/1) ... [2019-09-03 20:52:07,067 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:52:07,086 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:52:07,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:07,296 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:52:07,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:07,348 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:52:07,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07 WrapperNode [2019-09-03 20:52:07,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:07,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:52:07,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:52:07,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:52:07,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07" (1/1) ... [2019-09-03 20:52:07,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07" (1/1) ... [2019-09-03 20:52:07,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07" (1/1) ... [2019-09-03 20:52:07,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07" (1/1) ... [2019-09-03 20:52:07,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07" (1/1) ... [2019-09-03 20:52:07,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07" (1/1) ... [2019-09-03 20:52:07,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07" (1/1) ... [2019-09-03 20:52:07,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:52:07,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:52:07,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:52:07,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:52:07,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07" (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 [2019-09-03 20:52:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:52:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:52:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:52:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:52:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:52:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:52:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:52:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:52:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:52:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:52:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:52:07,849 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:52:07,850 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:52:07,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:07 BoogieIcfgContainer [2019-09-03 20:52:07,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:52:07,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:52:07,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:52:07,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:52:07,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:52:07" (1/3) ... [2019-09-03 20:52:07,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad86afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:07, skipping insertion in model container [2019-09-03 20:52:07,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:07" (2/3) ... [2019-09-03 20:52:07,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad86afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:07, skipping insertion in model container [2019-09-03 20:52:07,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:07" (3/3) ... [2019-09-03 20:52:07,858 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-09-03 20:52:07,868 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:52:07,878 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:52:07,894 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:52:07,917 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:52:07,917 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:52:07,917 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:52:07,917 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:52:07,918 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:52:07,918 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:52:07,918 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:52:07,918 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:52:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-09-03 20:52:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:52:07,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:07,940 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:07,942 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-09-03 20:52:07,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:07,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:07,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:08,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:08,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:08,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:08,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:08,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:08,154 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-09-03 20:52:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,310 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-09-03 20:52:08,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:08,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 20:52:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,325 INFO L225 Difference]: With dead ends: 47 [2019-09-03 20:52:08,325 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:52:08,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:52:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 20:52:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:52:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-09-03 20:52:08,401 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-09-03 20:52:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,403 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-09-03 20:52:08,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-09-03 20:52:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:52:08,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,407 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,409 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-09-03 20:52:08,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:08,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:08,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:08,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:08,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:08,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:08,505 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-09-03 20:52:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,594 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2019-09-03 20:52:08,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:08,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 20:52:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,597 INFO L225 Difference]: With dead ends: 47 [2019-09-03 20:52:08,597 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:52:08,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:52:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-03 20:52:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:52:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-09-03 20:52:08,607 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-09-03 20:52:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,607 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-09-03 20:52:08,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-09-03 20:52:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:52:08,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,609 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,609 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-09-03 20:52:08,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:08,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:08,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:08,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:08,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:08,675 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-09-03 20:52:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,914 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2019-09-03 20:52:08,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:08,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 20:52:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,918 INFO L225 Difference]: With dead ends: 77 [2019-09-03 20:52:08,919 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 20:52:08,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 20:52:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-09-03 20:52:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 20:52:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-09-03 20:52:08,936 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-09-03 20:52:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,937 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-09-03 20:52:08,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-09-03 20:52:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:52:08,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,938 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,939 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-09-03 20:52:08,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:09,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:09,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:52:09,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:09,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:09,031 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-09-03 20:52:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:09,274 INFO L93 Difference]: Finished difference Result 103 states and 154 transitions. [2019-09-03 20:52:09,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:09,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-03 20:52:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:09,278 INFO L225 Difference]: With dead ends: 103 [2019-09-03 20:52:09,278 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 20:52:09,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:52:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 20:52:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-09-03 20:52:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:52:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-09-03 20:52:09,293 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-09-03 20:52:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:09,293 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-09-03 20:52:09,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-09-03 20:52:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:52:09,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:09,295 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:09,296 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-09-03 20:52:09,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:09,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:09,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:09,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:09,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:09,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:09,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:09,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:09,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:09,353 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-09-03 20:52:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:09,418 INFO L93 Difference]: Finished difference Result 104 states and 154 transitions. [2019-09-03 20:52:09,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:09,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 20:52:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:09,424 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:52:09,424 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:52:09,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:52:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-03 20:52:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 20:52:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-03 20:52:09,440 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-09-03 20:52:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:09,441 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-03 20:52:09,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-03 20:52:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:52:09,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:09,442 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:09,443 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:09,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-09-03 20:52:09,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:09,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:09,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:09,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:09,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:09,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:09,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:09,497 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-09-03 20:52:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:09,690 INFO L93 Difference]: Finished difference Result 155 states and 238 transitions. [2019-09-03 20:52:09,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:09,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-03 20:52:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:09,694 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:52:09,694 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 20:52:09,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 20:52:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-09-03 20:52:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 20:52:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-09-03 20:52:09,727 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-09-03 20:52:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:09,729 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-09-03 20:52:09,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-09-03 20:52:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:52:09,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:09,731 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:09,731 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-09-03 20:52:09,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:09,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:09,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:09,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:09,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:09,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:09,815 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-09-03 20:52:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:09,990 INFO L93 Difference]: Finished difference Result 187 states and 289 transitions. [2019-09-03 20:52:09,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:09,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-03 20:52:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:09,994 INFO L225 Difference]: With dead ends: 187 [2019-09-03 20:52:09,994 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 20:52:09,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 20:52:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-09-03 20:52:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-03 20:52:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-09-03 20:52:10,021 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-09-03 20:52:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:10,021 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-09-03 20:52:10,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-09-03 20:52:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:52:10,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:10,028 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:10,028 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:10,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:10,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-09-03 20:52:10,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:10,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:10,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:10,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:10,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:52:10,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:10,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:52:10,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:52:10,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:52:10,067 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-09-03 20:52:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:10,088 INFO L93 Difference]: Finished difference Result 232 states and 374 transitions. [2019-09-03 20:52:10,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:52:10,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-03 20:52:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:10,094 INFO L225 Difference]: With dead ends: 232 [2019-09-03 20:52:10,094 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 20:52:10,095 INFO L628 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 [2019-09-03 20:52:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 20:52:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-09-03 20:52:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 20:52:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-09-03 20:52:10,124 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-09-03 20:52:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:10,126 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-09-03 20:52:10,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:52:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-09-03 20:52:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:52:10,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:10,130 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:10,131 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:10,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:10,131 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-09-03 20:52:10,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:10,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:10,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:10,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:10,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:10,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:10,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:10,208 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-09-03 20:52:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:10,378 INFO L93 Difference]: Finished difference Result 332 states and 543 transitions. [2019-09-03 20:52:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:10,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-09-03 20:52:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:10,381 INFO L225 Difference]: With dead ends: 332 [2019-09-03 20:52:10,382 INFO L226 Difference]: Without dead ends: 332 [2019-09-03 20:52:10,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-03 20:52:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 226. [2019-09-03 20:52:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 20:52:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 361 transitions. [2019-09-03 20:52:10,400 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 361 transitions. Word has length 26 [2019-09-03 20:52:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:10,400 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 361 transitions. [2019-09-03 20:52:10,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 361 transitions. [2019-09-03 20:52:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:52:10,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:10,402 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:10,402 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:10,402 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-09-03 20:52:10,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:10,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:10,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:10,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:10,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:10,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:10,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:10,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:10,447 INFO L87 Difference]: Start difference. First operand 226 states and 361 transitions. Second operand 5 states. [2019-09-03 20:52:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:10,669 INFO L93 Difference]: Finished difference Result 356 states and 581 transitions. [2019-09-03 20:52:10,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:10,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-03 20:52:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:10,674 INFO L225 Difference]: With dead ends: 356 [2019-09-03 20:52:10,679 INFO L226 Difference]: Without dead ends: 356 [2019-09-03 20:52:10,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-03 20:52:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 226. [2019-09-03 20:52:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 20:52:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 359 transitions. [2019-09-03 20:52:10,705 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 359 transitions. Word has length 28 [2019-09-03 20:52:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:10,705 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 359 transitions. [2019-09-03 20:52:10,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 359 transitions. [2019-09-03 20:52:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:52:10,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:10,709 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:10,709 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:10,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-09-03 20:52:10,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:10,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:10,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:10,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:10,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:52:10,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:10,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:10,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:10,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:10,786 INFO L87 Difference]: Start difference. First operand 226 states and 359 transitions. Second operand 7 states. [2019-09-03 20:52:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:10,994 INFO L93 Difference]: Finished difference Result 360 states and 592 transitions. [2019-09-03 20:52:10,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:10,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-03 20:52:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:10,998 INFO L225 Difference]: With dead ends: 360 [2019-09-03 20:52:10,998 INFO L226 Difference]: Without dead ends: 360 [2019-09-03 20:52:11,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-03 20:52:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 306. [2019-09-03 20:52:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-03 20:52:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2019-09-03 20:52:11,018 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 31 [2019-09-03 20:52:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:11,019 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2019-09-03 20:52:11,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2019-09-03 20:52:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:52:11,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:11,021 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:11,021 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:11,021 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-09-03 20:52:11,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:11,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:11,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:11,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:11,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:52:11,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:11,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:11,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:11,075 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 7 states. [2019-09-03 20:52:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:11,302 INFO L93 Difference]: Finished difference Result 346 states and 557 transitions. [2019-09-03 20:52:11,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:11,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-03 20:52:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:11,306 INFO L225 Difference]: With dead ends: 346 [2019-09-03 20:52:11,306 INFO L226 Difference]: Without dead ends: 346 [2019-09-03 20:52:11,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-03 20:52:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 310. [2019-09-03 20:52:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-03 20:52:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 505 transitions. [2019-09-03 20:52:11,322 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 505 transitions. Word has length 41 [2019-09-03 20:52:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:11,322 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 505 transitions. [2019-09-03 20:52:11,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 505 transitions. [2019-09-03 20:52:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:52:11,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:11,324 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:11,324 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233346, now seen corresponding path program 1 times [2019-09-03 20:52:11,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:11,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:11,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:52:11,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:11,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:11,383 INFO L87 Difference]: Start difference. First operand 310 states and 505 transitions. Second operand 7 states. [2019-09-03 20:52:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:11,518 INFO L93 Difference]: Finished difference Result 315 states and 509 transitions. [2019-09-03 20:52:11,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:11,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-03 20:52:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:11,521 INFO L225 Difference]: With dead ends: 315 [2019-09-03 20:52:11,521 INFO L226 Difference]: Without dead ends: 315 [2019-09-03 20:52:11,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-03 20:52:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 185. [2019-09-03 20:52:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 20:52:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 278 transitions. [2019-09-03 20:52:11,533 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 278 transitions. Word has length 41 [2019-09-03 20:52:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:11,534 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 278 transitions. [2019-09-03 20:52:11,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 278 transitions. [2019-09-03 20:52:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:52:11,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:11,535 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:11,536 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1052669362, now seen corresponding path program 1 times [2019-09-03 20:52:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:11,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:11,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:11,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:11,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:11,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:11,578 INFO L87 Difference]: Start difference. First operand 185 states and 278 transitions. Second operand 6 states. [2019-09-03 20:52:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:11,689 INFO L93 Difference]: Finished difference Result 342 states and 552 transitions. [2019-09-03 20:52:11,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:11,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-09-03 20:52:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:11,692 INFO L225 Difference]: With dead ends: 342 [2019-09-03 20:52:11,692 INFO L226 Difference]: Without dead ends: 342 [2019-09-03 20:52:11,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-03 20:52:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 318. [2019-09-03 20:52:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-03 20:52:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 511 transitions. [2019-09-03 20:52:11,708 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 511 transitions. Word has length 48 [2019-09-03 20:52:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:11,709 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 511 transitions. [2019-09-03 20:52:11,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 511 transitions. [2019-09-03 20:52:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 20:52:11,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:11,711 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:11,711 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-09-03 20:52:11,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:11,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:11,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:11,766 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2019-09-03 20:52:11,768 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [47], [51], [56], [61], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116] [2019-09-03 20:52:11,807 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:11,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:11,895 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:52:12,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:12,008 INFO L272 AbstractInterpreter]: Visited 30 different actions 102 times. Merged at 11 different actions 11 times. Never widened. Performed 119 root evaluator evaluations with a maximum evaluation depth of 8. Performed 119 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2019-09-03 20:52:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:12,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:12,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:12,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:12,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:12,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:12,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:52:12,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-03 20:52:12,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:12,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:52:12,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 12 [2019-09-03 20:52:12,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:12,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:12,218 INFO L87 Difference]: Start difference. First operand 318 states and 511 transitions. Second operand 6 states. [2019-09-03 20:52:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:12,431 INFO L93 Difference]: Finished difference Result 347 states and 552 transitions. [2019-09-03 20:52:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:12,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-09-03 20:52:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:12,434 INFO L225 Difference]: With dead ends: 347 [2019-09-03 20:52:12,435 INFO L226 Difference]: Without dead ends: 347 [2019-09-03 20:52:12,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:52:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-03 20:52:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 322. [2019-09-03 20:52:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-03 20:52:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 515 transitions. [2019-09-03 20:52:12,453 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 515 transitions. Word has length 61 [2019-09-03 20:52:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:12,453 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 515 transitions. [2019-09-03 20:52:12,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 515 transitions. [2019-09-03 20:52:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 20:52:12,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:12,456 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:12,456 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:12,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2141038378, now seen corresponding path program 1 times [2019-09-03 20:52:12,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:12,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:12,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:12,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:12,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:52:12,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:12,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:12,512 INFO L87 Difference]: Start difference. First operand 322 states and 515 transitions. Second operand 7 states. [2019-09-03 20:52:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:12,661 INFO L93 Difference]: Finished difference Result 372 states and 596 transitions. [2019-09-03 20:52:12,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:12,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-03 20:52:12,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:12,665 INFO L225 Difference]: With dead ends: 372 [2019-09-03 20:52:12,665 INFO L226 Difference]: Without dead ends: 372 [2019-09-03 20:52:12,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-03 20:52:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 326. [2019-09-03 20:52:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-03 20:52:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 518 transitions. [2019-09-03 20:52:12,681 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 518 transitions. Word has length 75 [2019-09-03 20:52:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:12,682 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 518 transitions. [2019-09-03 20:52:12,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 518 transitions. [2019-09-03 20:52:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 20:52:12,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:12,684 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:12,684 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1931813206, now seen corresponding path program 1 times [2019-09-03 20:52:12,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:12,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:12,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:12,752 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-03 20:52:12,752 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [39], [42], [47], [51], [56], [61], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116] [2019-09-03 20:52:12,758 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:12,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:12,767 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:52:12,906 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:12,906 INFO L272 AbstractInterpreter]: Visited 41 different actions 164 times. Merged at 17 different actions 17 times. Never widened. Performed 190 root evaluator evaluations with a maximum evaluation depth of 8. Performed 190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 3 fixpoints after 2 different actions. Largest state had 15 variables. [2019-09-03 20:52:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:12,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:12,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:12,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:12,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:12,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:52:12,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:13,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:13,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:13,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:13,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2019-09-03 20:52:13,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:13,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:52:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:52:13,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:52:13,238 INFO L87 Difference]: Start difference. First operand 326 states and 518 transitions. Second operand 13 states. [2019-09-03 20:52:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:14,797 INFO L93 Difference]: Finished difference Result 640 states and 1048 transitions. [2019-09-03 20:52:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:52:14,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-09-03 20:52:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:14,809 INFO L225 Difference]: With dead ends: 640 [2019-09-03 20:52:14,809 INFO L226 Difference]: Without dead ends: 640 [2019-09-03 20:52:14,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=967, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:52:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-03 20:52:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 384. [2019-09-03 20:52:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-03 20:52:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 616 transitions. [2019-09-03 20:52:14,833 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 616 transitions. Word has length 83 [2019-09-03 20:52:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:14,833 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 616 transitions. [2019-09-03 20:52:14,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:52:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 616 transitions. [2019-09-03 20:52:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:52:14,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:14,836 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:14,836 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:14,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2023812105, now seen corresponding path program 2 times [2019-09-03 20:52:14,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:14,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:14,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:14,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:14,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:14,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:14,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:14,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:14,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:14,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:14,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:14,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:52:14,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:14,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:52:15,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:15,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:15,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:15,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2019-09-03 20:52:15,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:15,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:52:15,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:52:15,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:52:15,363 INFO L87 Difference]: Start difference. First operand 384 states and 616 transitions. Second operand 13 states. [2019-09-03 20:52:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:15,685 INFO L93 Difference]: Finished difference Result 405 states and 644 transitions. [2019-09-03 20:52:15,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:52:15,686 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-03 20:52:15,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:15,689 INFO L225 Difference]: With dead ends: 405 [2019-09-03 20:52:15,690 INFO L226 Difference]: Without dead ends: 333 [2019-09-03 20:52:15,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:52:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-03 20:52:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 322. [2019-09-03 20:52:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-03 20:52:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 499 transitions. [2019-09-03 20:52:15,712 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 499 transitions. Word has length 88 [2019-09-03 20:52:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:15,713 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 499 transitions. [2019-09-03 20:52:15,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:52:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 499 transitions. [2019-09-03 20:52:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 20:52:15,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:15,721 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:15,722 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:15,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1044380688, now seen corresponding path program 1 times [2019-09-03 20:52:15,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:15,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:15,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:15,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:15,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:15,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-03 20:52:15,813 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [39], [42], [47], [51], [54], [56], [61], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118], [119], [120] [2019-09-03 20:52:15,822 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:15,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:15,828 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:52:15,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:15,919 INFO L272 AbstractInterpreter]: Visited 48 different actions 198 times. Merged at 21 different actions 21 times. Never widened. Performed 230 root evaluator evaluations with a maximum evaluation depth of 8. Performed 230 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 3 different actions. Largest state had 16 variables. [2019-09-03 20:52:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:15,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:15,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:15,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:15,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:15,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:15,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:52:15,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 382 proven. 8 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-09-03 20:52:16,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:18,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:18,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2019-09-03 20:52:18,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:18,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:52:18,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:52:18,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=430, Unknown=1, NotChecked=0, Total=506 [2019-09-03 20:52:18,961 INFO L87 Difference]: Start difference. First operand 322 states and 499 transitions. Second operand 16 states. [2019-09-03 20:52:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:21,630 INFO L93 Difference]: Finished difference Result 726 states and 1166 transitions. [2019-09-03 20:52:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:52:21,635 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 132 [2019-09-03 20:52:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:21,640 INFO L225 Difference]: With dead ends: 726 [2019-09-03 20:52:21,640 INFO L226 Difference]: Without dead ends: 673 [2019-09-03 20:52:21,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=565, Invalid=2086, Unknown=1, NotChecked=0, Total=2652 [2019-09-03 20:52:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-03 20:52:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 542. [2019-09-03 20:52:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-03 20:52:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 873 transitions. [2019-09-03 20:52:21,668 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 873 transitions. Word has length 132 [2019-09-03 20:52:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:21,668 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 873 transitions. [2019-09-03 20:52:21,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:52:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 873 transitions. [2019-09-03 20:52:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 20:52:21,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:21,672 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:21,672 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1931603534, now seen corresponding path program 1 times [2019-09-03 20:52:21,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:21,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:21,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:21,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:21,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:21,760 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-03 20:52:21,761 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [39], [42], [44], [47], [51], [54], [56], [61], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118], [119], [120] [2019-09-03 20:52:21,766 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:21,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:21,769 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:52:21,842 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:21,842 INFO L272 AbstractInterpreter]: Visited 49 different actions 200 times. Merged at 21 different actions 21 times. Never widened. Performed 233 root evaluator evaluations with a maximum evaluation depth of 8. Performed 233 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 7 fixpoints after 4 different actions. Largest state had 16 variables. [2019-09-03 20:52:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:21,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:21,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:21,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:21,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:21,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:21,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:52:21,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 382 proven. 8 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-09-03 20:52:22,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:22,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:22,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2019-09-03 20:52:22,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:22,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:52:22,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:52:22,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:22,258 INFO L87 Difference]: Start difference. First operand 542 states and 873 transitions. Second operand 14 states. [2019-09-03 20:52:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:24,113 INFO L93 Difference]: Finished difference Result 537 states and 829 transitions. [2019-09-03 20:52:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:52:24,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 132 [2019-09-03 20:52:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:24,114 INFO L225 Difference]: With dead ends: 537 [2019-09-03 20:52:24,114 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:52:24,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:52:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:52:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:52:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:52:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:52:24,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2019-09-03 20:52:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:24,117 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:52:24,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:52:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:52:24,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:52:24,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:52:24 BoogieIcfgContainer [2019-09-03 20:52:24,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:52:24,124 INFO L168 Benchmark]: Toolchain (without parser) took 17072.29 ms. Allocated memory was 132.1 MB in the beginning and 382.2 MB in the end (delta: 250.1 MB). Free memory was 87.9 MB in the beginning and 127.8 MB in the end (delta: -39.9 MB). Peak memory consumption was 210.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:24,124 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-03 20:52:24,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.80 ms. Allocated memory is still 132.1 MB. Free memory was 87.9 MB in the beginning and 77.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:24,126 INFO L168 Benchmark]: Boogie Preprocessor took 138.20 ms. Allocated memory was 132.1 MB in the beginning and 200.8 MB in the end (delta: 68.7 MB). Free memory was 77.5 MB in the beginning and 176.6 MB in the end (delta: -99.1 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:24,127 INFO L168 Benchmark]: RCFGBuilder took 363.46 ms. Allocated memory is still 200.8 MB. Free memory was 176.6 MB in the beginning and 161.2 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:24,128 INFO L168 Benchmark]: TraceAbstraction took 16269.81 ms. Allocated memory was 200.8 MB in the beginning and 382.2 MB in the end (delta: 181.4 MB). Free memory was 161.2 MB in the beginning and 127.8 MB in the end (delta: 33.4 MB). Peak memory consumption was 214.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:24,131 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.80 ms. Allocated memory is still 132.1 MB. Free memory was 87.9 MB in the beginning and 77.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.20 ms. Allocated memory was 132.1 MB in the beginning and 200.8 MB in the end (delta: 68.7 MB). Free memory was 77.5 MB in the beginning and 176.6 MB in the end (delta: -99.1 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.46 ms. Allocated memory is still 200.8 MB. Free memory was 176.6 MB in the beginning and 161.2 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16269.81 ms. Allocated memory was 200.8 MB in the beginning and 382.2 MB in the end (delta: 181.4 MB). Free memory was 161.2 MB in the beginning and 127.8 MB in the end (delta: 33.4 MB). Peak memory consumption was 214.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. SAFE Result, 16.2s OverallTime, 20 OverallIterations, 21 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1558 SDtfs, 1102 SDslu, 5441 SDs, 0 SdLazy, 4518 SolverSat, 2140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 998 SyntacticMatches, 3 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1042 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1419 NumberOfCodeBlocks, 1358 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1885 ConstructedInterpolants, 59 QuantifiedInterpolants, 484851 SizeOfPredicates, 27 NumberOfNonLiveVariables, 920 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 7580/7694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...