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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:58:45,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:58:45,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:58:45,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:58:45,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:58:45,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:58:45,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:58:45,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:58:45,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:58:45,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:58:45,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:58:45,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:58:45,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:58:45,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:58:45,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:58:45,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:58:45,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:58:45,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:58:45,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:58:45,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:58:45,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:58:45,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:58:45,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:58:45,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:58:45,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:58:45,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:58:45,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:58:45,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:58:45,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:58:45,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:58:45,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:58:45,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:58:45,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:58:45,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:58:45,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:58:45,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:58:45,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:58:45,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:58:45,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:58:45,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:58:45,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:58:45,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:58:45,483 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:58:45,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:58:45,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:58:45,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:58:45,485 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:58:45,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:58:45,485 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:58:45,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:58:45,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:58:45,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:58:45,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:58:45,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:58:45,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:58:45,486 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:58:45,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:58:45,487 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:58:45,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:58:45,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:58:45,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:58:45,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:58:45,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:58:45,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:58:45,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:58:45,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:58:45,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:58:45,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:58:45,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:58:45,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:58:45,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:58:45,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:58:45,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:58:45,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:58:45,777 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:58:45,778 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:58:45,778 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-13 22:58:45,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbefd3635/72d33ac2320243a5a658dd268e07c423/FLAG439d03624 [2019-10-13 22:58:46,354 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:58:46,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-13 22:58:46,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbefd3635/72d33ac2320243a5a658dd268e07c423/FLAG439d03624 [2019-10-13 22:58:46,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbefd3635/72d33ac2320243a5a658dd268e07c423 [2019-10-13 22:58:46,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:58:46,671 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:58:46,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:46,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:58:46,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:58:46,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:46,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb039ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46, skipping insertion in model container [2019-10-13 22:58:46,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:46,687 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:58:46,707 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:58:46,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:46,905 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:58:46,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:46,937 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:58:46,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46 WrapperNode [2019-10-13 22:58:46,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:46,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:58:46,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:58:46,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:58:47,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:47,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:47,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:47,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:47,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:47,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:47,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:47,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:58:47,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:58:47,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:58:47,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:58:47,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46" (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-10-13 22:58:47,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:58:47,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:58:47,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:58:47,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:58:47,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:58:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:58:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:58:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:58:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:58:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:58:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:58:47,481 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:58:47,482 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 22:58:47,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:47 BoogieIcfgContainer [2019-10-13 22:58:47,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:58:47,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:58:47,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:58:47,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:58:47,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:58:46" (1/3) ... [2019-10-13 22:58:47,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6867526a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:47, skipping insertion in model container [2019-10-13 22:58:47,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46" (2/3) ... [2019-10-13 22:58:47,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6867526a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:47, skipping insertion in model container [2019-10-13 22:58:47,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:47" (3/3) ... [2019-10-13 22:58:47,491 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-10-13 22:58:47,500 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:58:47,508 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:58:47,519 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:58:47,543 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:58:47,543 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:58:47,543 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:58:47,544 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:58:47,544 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:58:47,544 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:58:47,544 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:58:47,544 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:58:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-10-13 22:58:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:58:47,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:47,570 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:47,572 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1191516201, now seen corresponding path program 1 times [2019-10-13 22:58:47,588 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:47,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563691952] [2019-10-13 22:58:47,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:47,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563691952] [2019-10-13 22:58:47,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:47,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440277330] [2019-10-13 22:58:47,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:47,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:47,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:47,826 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 5 states. [2019-10-13 22:58:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,013 INFO L93 Difference]: Finished difference Result 78 states and 129 transitions. [2019-10-13 22:58:48,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:48,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-13 22:58:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,029 INFO L225 Difference]: With dead ends: 78 [2019-10-13 22:58:48,030 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 22:58:48,037 INFO L600 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-10-13 22:58:48,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 22:58:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-13 22:58:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 22:58:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2019-10-13 22:58:48,125 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 13 [2019-10-13 22:58:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,126 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2019-10-13 22:58:48,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2019-10-13 22:58:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:58:48,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,129 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,130 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1186779432, now seen corresponding path program 1 times [2019-10-13 22:58:48,132 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616184794] [2019-10-13 22:58:48,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:48,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616184794] [2019-10-13 22:58:48,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:48,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783374399] [2019-10-13 22:58:48,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:48,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:48,261 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 5 states. [2019-10-13 22:58:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,369 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-10-13 22:58:48,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:48,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-13 22:58:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,371 INFO L225 Difference]: With dead ends: 47 [2019-10-13 22:58:48,372 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 22:58:48,373 INFO L600 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-10-13 22:58:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 22:58:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-13 22:58:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 22:58:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2019-10-13 22:58:48,384 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 13 [2019-10-13 22:58:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,385 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-10-13 22:58:48,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2019-10-13 22:58:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:58:48,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,386 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,386 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash 381238888, now seen corresponding path program 1 times [2019-10-13 22:58:48,387 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268985417] [2019-10-13 22:58:48,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:48,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268985417] [2019-10-13 22:58:48,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:58:48,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426325337] [2019-10-13 22:58:48,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:58:48,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:58:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:48,483 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand 6 states. [2019-10-13 22:58:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,774 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-10-13 22:58:48,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:58:48,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-13 22:58:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,777 INFO L225 Difference]: With dead ends: 76 [2019-10-13 22:58:48,777 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 22:58:48,777 INFO L600 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-10-13 22:58:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 22:58:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2019-10-13 22:58:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 22:58:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2019-10-13 22:58:48,795 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 13 [2019-10-13 22:58:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,795 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2019-10-13 22:58:48,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:58:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2019-10-13 22:58:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 22:58:48,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,797 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,797 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1990396420, now seen corresponding path program 1 times [2019-10-13 22:58:48,798 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248404821] [2019-10-13 22:58:48,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:48,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248404821] [2019-10-13 22:58:48,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:58:48,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092678405] [2019-10-13 22:58:48,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:58:48,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:58:48,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:48,886 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand 6 states. [2019-10-13 22:58:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,069 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2019-10-13 22:58:49,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 22:58:49,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 22:58:49,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,071 INFO L225 Difference]: With dead ends: 76 [2019-10-13 22:58:49,072 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 22:58:49,072 INFO L600 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-10-13 22:58:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 22:58:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-13 22:58:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-13 22:58:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2019-10-13 22:58:49,088 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 18 [2019-10-13 22:58:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,089 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-10-13 22:58:49,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:58:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2019-10-13 22:58:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 22:58:49,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,090 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,091 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1609033957, now seen corresponding path program 1 times [2019-10-13 22:58:49,091 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518629062] [2019-10-13 22:58:49,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:49,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518629062] [2019-10-13 22:58:49,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:49,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178864561] [2019-10-13 22:58:49,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:49,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:49,160 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand 5 states. [2019-10-13 22:58:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,235 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2019-10-13 22:58:49,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:49,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-13 22:58:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,237 INFO L225 Difference]: With dead ends: 79 [2019-10-13 22:58:49,238 INFO L226 Difference]: Without dead ends: 77 [2019-10-13 22:58:49,239 INFO L600 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-10-13 22:58:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-13 22:58:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-13 22:58:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-13 22:58:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2019-10-13 22:58:49,269 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 18 [2019-10-13 22:58:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,270 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2019-10-13 22:58:49,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2019-10-13 22:58:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 22:58:49,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,274 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,274 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,275 INFO L82 PathProgramCache]: Analyzing trace with hash -915397493, now seen corresponding path program 1 times [2019-10-13 22:58:49,275 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940101058] [2019-10-13 22:58:49,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:49,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940101058] [2019-10-13 22:58:49,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:58:49,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465222435] [2019-10-13 22:58:49,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:58:49,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:58:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:49,376 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand 6 states. [2019-10-13 22:58:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,508 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2019-10-13 22:58:49,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 22:58:49,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 22:58:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,510 INFO L225 Difference]: With dead ends: 83 [2019-10-13 22:58:49,510 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 22:58:49,511 INFO L600 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-10-13 22:58:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 22:58:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-13 22:58:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 22:58:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2019-10-13 22:58:49,525 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 18 [2019-10-13 22:58:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,525 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2019-10-13 22:58:49,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:58:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2019-10-13 22:58:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 22:58:49,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,526 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,527 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash -742213082, now seen corresponding path program 1 times [2019-10-13 22:58:49,527 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960928713] [2019-10-13 22:58:49,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:49,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960928713] [2019-10-13 22:58:49,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 22:58:49,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507690593] [2019-10-13 22:58:49,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 22:58:49,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 22:58:49,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:49,615 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand 7 states. [2019-10-13 22:58:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,847 INFO L93 Difference]: Finished difference Result 122 states and 169 transitions. [2019-10-13 22:58:49,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 22:58:49,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-10-13 22:58:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,852 INFO L225 Difference]: With dead ends: 122 [2019-10-13 22:58:49,853 INFO L226 Difference]: Without dead ends: 120 [2019-10-13 22:58:49,853 INFO L600 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-10-13 22:58:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-13 22:58:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2019-10-13 22:58:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-13 22:58:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2019-10-13 22:58:49,891 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 18 [2019-10-13 22:58:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,891 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2019-10-13 22:58:49,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 22:58:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2019-10-13 22:58:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 22:58:49,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,894 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,894 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1815138482, now seen corresponding path program 1 times [2019-10-13 22:58:49,895 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698433635] [2019-10-13 22:58:49,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 22:58:49,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698433635] [2019-10-13 22:58:49,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:58:49,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892662808] [2019-10-13 22:58:49,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:58:49,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:58:49,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:49,971 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand 6 states. [2019-10-13 22:58:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,134 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions. [2019-10-13 22:58:50,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:58:50,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-13 22:58:50,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,140 INFO L225 Difference]: With dead ends: 157 [2019-10-13 22:58:50,140 INFO L226 Difference]: Without dead ends: 155 [2019-10-13 22:58:50,141 INFO L600 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-10-13 22:58:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-13 22:58:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2019-10-13 22:58:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-13 22:58:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2019-10-13 22:58:50,179 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 25 [2019-10-13 22:58:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,181 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2019-10-13 22:58:50,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:58:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2019-10-13 22:58:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 22:58:50,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,188 INFO L380 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] [2019-10-13 22:58:50,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1476054722, now seen corresponding path program 1 times [2019-10-13 22:58:50,189 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73478401] [2019-10-13 22:58:50,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 22:58:50,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73478401] [2019-10-13 22:58:50,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 22:58:50,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176837238] [2019-10-13 22:58:50,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 22:58:50,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 22:58:50,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:50,270 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand 7 states. [2019-10-13 22:58:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,430 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2019-10-13 22:58:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:58:50,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-10-13 22:58:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,433 INFO L225 Difference]: With dead ends: 130 [2019-10-13 22:58:50,433 INFO L226 Difference]: Without dead ends: 128 [2019-10-13 22:58:50,434 INFO L600 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-10-13 22:58:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-13 22:58:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2019-10-13 22:58:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-13 22:58:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-10-13 22:58:50,447 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-10-13 22:58:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,447 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-10-13 22:58:50,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 22:58:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-10-13 22:58:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 22:58:50,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,449 INFO L380 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] [2019-10-13 22:58:50,449 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -388432127, now seen corresponding path program 1 times [2019-10-13 22:58:50,450 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029872822] [2019-10-13 22:58:50,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 22:58:50,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029872822] [2019-10-13 22:58:50,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 22:58:50,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833103668] [2019-10-13 22:58:50,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 22:58:50,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 22:58:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:50,523 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 7 states. [2019-10-13 22:58:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,714 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2019-10-13 22:58:50,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:58:50,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-10-13 22:58:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,716 INFO L225 Difference]: With dead ends: 102 [2019-10-13 22:58:50,716 INFO L226 Difference]: Without dead ends: 100 [2019-10-13 22:58:50,717 INFO L600 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-10-13 22:58:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-13 22:58:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2019-10-13 22:58:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-13 22:58:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-10-13 22:58:50,729 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 30 [2019-10-13 22:58:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,729 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-10-13 22:58:50,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 22:58:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-10-13 22:58:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 22:58:50,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,730 INFO L380 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] [2019-10-13 22:58:50,731 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1762875004, now seen corresponding path program 1 times [2019-10-13 22:58:50,731 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574336963] [2019-10-13 22:58:50,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-13 22:58:50,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574336963] [2019-10-13 22:58:50,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 22:58:50,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568964434] [2019-10-13 22:58:50,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 22:58:50,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 22:58:50,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-13 22:58:50,844 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 8 states. [2019-10-13 22:58:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:51,120 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2019-10-13 22:58:51,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 22:58:51,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-13 22:58:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:51,123 INFO L225 Difference]: With dead ends: 161 [2019-10-13 22:58:51,123 INFO L226 Difference]: Without dead ends: 159 [2019-10-13 22:58:51,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 22:58:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-13 22:58:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2019-10-13 22:58:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-13 22:58:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 202 transitions. [2019-10-13 22:58:51,143 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 202 transitions. Word has length 39 [2019-10-13 22:58:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:51,143 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 202 transitions. [2019-10-13 22:58:51,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 22:58:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 202 transitions. [2019-10-13 22:58:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 22:58:51,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:51,145 INFO L380 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] [2019-10-13 22:58:51,145 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash -696616044, now seen corresponding path program 1 times [2019-10-13 22:58:51,146 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:51,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93710708] [2019-10-13 22:58:51,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:51,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:51,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-13 22:58:51,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93710708] [2019-10-13 22:58:51,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:51,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:58:51,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749322949] [2019-10-13 22:58:51,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:58:51,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:58:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:51,194 INFO L87 Difference]: Start difference. First operand 153 states and 202 transitions. Second operand 6 states. [2019-10-13 22:58:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:51,339 INFO L93 Difference]: Finished difference Result 235 states and 338 transitions. [2019-10-13 22:58:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:58:51,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-13 22:58:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:51,343 INFO L225 Difference]: With dead ends: 235 [2019-10-13 22:58:51,343 INFO L226 Difference]: Without dead ends: 233 [2019-10-13 22:58:51,343 INFO L600 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-10-13 22:58:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-13 22:58:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 210. [2019-10-13 22:58:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-13 22:58:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 297 transitions. [2019-10-13 22:58:51,373 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 297 transitions. Word has length 46 [2019-10-13 22:58:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:51,373 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 297 transitions. [2019-10-13 22:58:51,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:58:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 297 transitions. [2019-10-13 22:58:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 22:58:51,375 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:51,375 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2019-10-13 22:58:51,375 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:51,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1730536098, now seen corresponding path program 1 times [2019-10-13 22:58:51,376 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:51,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736729331] [2019-10-13 22:58:51,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:51,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:51,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 22:58:51,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736729331] [2019-10-13 22:58:51,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:51,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 22:58:51,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884555417] [2019-10-13 22:58:51,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 22:58:51,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 22:58:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-13 22:58:51,458 INFO L87 Difference]: Start difference. First operand 210 states and 297 transitions. Second operand 9 states. [2019-10-13 22:58:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:51,952 INFO L93 Difference]: Finished difference Result 570 states and 888 transitions. [2019-10-13 22:58:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 22:58:51,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-10-13 22:58:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:51,959 INFO L225 Difference]: With dead ends: 570 [2019-10-13 22:58:51,959 INFO L226 Difference]: Without dead ends: 568 [2019-10-13 22:58:51,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-13 22:58:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-13 22:58:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 497. [2019-10-13 22:58:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-13 22:58:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 774 transitions. [2019-10-13 22:58:52,039 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 774 transitions. Word has length 53 [2019-10-13 22:58:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:52,039 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 774 transitions. [2019-10-13 22:58:52,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 22:58:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 774 transitions. [2019-10-13 22:58:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 22:58:52,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:52,042 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:52,043 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:52,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:52,043 INFO L82 PathProgramCache]: Analyzing trace with hash -589963654, now seen corresponding path program 1 times [2019-10-13 22:58:52,043 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:52,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939380799] [2019-10-13 22:58:52,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:52,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:52,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 22:58:52,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939380799] [2019-10-13 22:58:52,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:52,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 22:58:52,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183752757] [2019-10-13 22:58:52,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 22:58:52,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 22:58:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:52,117 INFO L87 Difference]: Start difference. First operand 497 states and 774 transitions. Second operand 7 states. [2019-10-13 22:58:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:52,379 INFO L93 Difference]: Finished difference Result 691 states and 1114 transitions. [2019-10-13 22:58:52,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 22:58:52,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-13 22:58:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:52,385 INFO L225 Difference]: With dead ends: 691 [2019-10-13 22:58:52,385 INFO L226 Difference]: Without dead ends: 689 [2019-10-13 22:58:52,386 INFO L600 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-10-13 22:58:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-10-13 22:58:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 561. [2019-10-13 22:58:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-13 22:58:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 885 transitions. [2019-10-13 22:58:52,460 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 885 transitions. Word has length 60 [2019-10-13 22:58:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:52,460 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 885 transitions. [2019-10-13 22:58:52,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 22:58:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 885 transitions. [2019-10-13 22:58:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 22:58:52,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:52,463 INFO L380 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] [2019-10-13 22:58:52,463 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash -751656022, now seen corresponding path program 1 times [2019-10-13 22:58:52,464 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:52,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032859967] [2019-10-13 22:58:52,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:52,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:52,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 22:58:52,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032859967] [2019-10-13 22:58:52,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062858851] [2019-10-13 22:58:52,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:52,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 22:58:52,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:58:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-13 22:58:52,669 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:58:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 22:58:52,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 22:58:52,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2019-10-13 22:58:52,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609260624] [2019-10-13 22:58:52,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:52,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:52,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:52,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-13 22:58:52,764 INFO L87 Difference]: Start difference. First operand 561 states and 885 transitions. Second operand 5 states. [2019-10-13 22:58:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:53,075 INFO L93 Difference]: Finished difference Result 1210 states and 1913 transitions. [2019-10-13 22:58:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:53,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-13 22:58:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:53,082 INFO L225 Difference]: With dead ends: 1210 [2019-10-13 22:58:53,082 INFO L226 Difference]: Without dead ends: 673 [2019-10-13 22:58:53,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-13 22:58:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-10-13 22:58:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 579. [2019-10-13 22:58:53,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 22:58:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 903 transitions. [2019-10-13 22:58:53,221 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 903 transitions. Word has length 60 [2019-10-13 22:58:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:53,222 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 903 transitions. [2019-10-13 22:58:53,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 903 transitions. [2019-10-13 22:58:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-13 22:58:53,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:53,226 INFO L380 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] [2019-10-13 22:58:53,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:53,430 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:53,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash -678920824, now seen corresponding path program 1 times [2019-10-13 22:58:53,430 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:53,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657142409] [2019-10-13 22:58:53,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:53,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:53,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-13 22:58:53,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657142409] [2019-10-13 22:58:53,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758799913] [2019-10-13 22:58:53,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:53,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 22:58:53,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:58:53,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:58:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-13 22:58:53,663 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:58:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-13 22:58:53,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [293941672] [2019-10-13 22:58:53,827 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-13 22:58:53,828 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:58:53,835 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:58:53,849 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:58:53,850 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:58:53,921 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs