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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:05:09,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:05:09,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:05:09,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:05:09,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:05:09,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:05:09,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:05:09,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:05:09,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:05:09,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:05:09,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:05:09,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:05:09,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:05:09,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:05:09,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:05:09,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:05:09,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:05:09,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:05:09,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:05:09,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:05:09,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:05:09,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:05:09,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:05:09,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:05:09,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:05:09,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:05:09,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:05:09,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:05:09,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:05:09,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:05:09,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:05:09,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:05:09,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:05:09,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:05:09,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:05:09,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:05:09,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:05:09,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:05:09,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:05:09,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:05:09,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:05:09,415 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-15 01:05:09,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:05:09,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:05:09,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:05:09,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:05:09,439 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:05:09,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:05:09,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:05:09,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:05:09,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:05:09,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:05:09,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:05:09,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:05:09,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:05:09,442 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:05:09,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:05:09,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:05:09,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:05:09,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:05:09,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:05:09,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:05:09,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:05:09,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:09,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:05:09,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:05:09,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:05:09,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:05:09,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:05:09,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:05:09,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:05:09,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:05:09,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:05:09,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:05:09,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:05:09,754 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:05:09,755 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-15 01:05:09,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782a74fbd/876d4d7dd33f44cdbcb2fbf47a651ce2/FLAGaa8f6ed30 [2019-10-15 01:05:10,271 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:05:10,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-15 01:05:10,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782a74fbd/876d4d7dd33f44cdbcb2fbf47a651ce2/FLAGaa8f6ed30 [2019-10-15 01:05:10,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782a74fbd/876d4d7dd33f44cdbcb2fbf47a651ce2 [2019-10-15 01:05:10,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:05:10,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:05:10,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:10,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:05:10,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:05:10,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:10,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57118955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10, skipping insertion in model container [2019-10-15 01:05:10,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:10,706 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:05:10,726 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:05:10,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:10,934 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:05:10,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:10,976 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:05:10,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10 WrapperNode [2019-10-15 01:05:10,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:10,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:05:10,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:05:10,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:05:11,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:11,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:11,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:11,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:11,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:11,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:11,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:11,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:05:11,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:05:11,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:05:11,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:05:11,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (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-15 01:05:11,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:05:11,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:05:11,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:05:11,171 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:05:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:05:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:05:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:05:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:05:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:05:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:05:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:05:11,477 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:05:11,478 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 01:05:11,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:11 BoogieIcfgContainer [2019-10-15 01:05:11,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:05:11,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:05:11,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:05:11,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:05:11,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:05:10" (1/3) ... [2019-10-15 01:05:11,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb175bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:11, skipping insertion in model container [2019-10-15 01:05:11,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (2/3) ... [2019-10-15 01:05:11,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb175bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:11, skipping insertion in model container [2019-10-15 01:05:11,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:11" (3/3) ... [2019-10-15 01:05:11,500 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-10-15 01:05:11,517 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:05:11,524 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:05:11,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:05:11,559 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:05:11,560 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:05:11,560 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:05:11,560 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:05:11,560 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:05:11,560 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:05:11,561 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:05:11,561 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:05:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-10-15 01:05:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:05:11,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:11,601 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:11,606 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:11,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-10-15 01:05:11,619 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:11,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877200473] [2019-10-15 01:05:11,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:11,839 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-15 01:05:11,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877200473] [2019-10-15 01:05:11,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:11,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:11,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424724938] [2019-10-15 01:05:11,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:11,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:11,865 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-10-15 01:05:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:12,004 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2019-10-15 01:05:12,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:12,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-15 01:05:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:12,016 INFO L225 Difference]: With dead ends: 83 [2019-10-15 01:05:12,017 INFO L226 Difference]: Without dead ends: 42 [2019-10-15 01:05:12,023 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-15 01:05:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-15 01:05:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-15 01:05:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-15 01:05:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-10-15 01:05:12,076 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-10-15 01:05:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:12,077 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-10-15 01:05:12,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-10-15 01:05:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:05:12,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:12,079 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:12,079 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-10-15 01:05:12,080 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:12,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304048921] [2019-10-15 01:05:12,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:12,144 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-15 01:05:12,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304048921] [2019-10-15 01:05:12,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:12,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:12,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693413321] [2019-10-15 01:05:12,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:12,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:12,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:12,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:12,152 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-10-15 01:05:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:12,267 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2019-10-15 01:05:12,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:12,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-15 01:05:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:12,270 INFO L225 Difference]: With dead ends: 49 [2019-10-15 01:05:12,270 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 01:05:12,271 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-15 01:05:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 01:05:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-15 01:05:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:05:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-10-15 01:05:12,285 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-10-15 01:05:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:12,285 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-10-15 01:05:12,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-10-15 01:05:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:05:12,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:12,286 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:12,287 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-10-15 01:05:12,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:12,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443483825] [2019-10-15 01:05:12,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:12,377 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-15 01:05:12,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443483825] [2019-10-15 01:05:12,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:12,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:12,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099428075] [2019-10-15 01:05:12,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:12,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:12,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:12,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:12,384 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-10-15 01:05:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:12,656 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2019-10-15 01:05:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:12,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-15 01:05:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:12,659 INFO L225 Difference]: With dead ends: 79 [2019-10-15 01:05:12,659 INFO L226 Difference]: Without dead ends: 77 [2019-10-15 01:05:12,660 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-15 01:05:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-15 01:05:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-10-15 01:05:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-15 01:05:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-10-15 01:05:12,686 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-10-15 01:05:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:12,687 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-10-15 01:05:12,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-10-15 01:05:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:05:12,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:12,688 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:12,688 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-10-15 01:05:12,690 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:12,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646710856] [2019-10-15 01:05:12,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:12,795 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-15 01:05:12,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646710856] [2019-10-15 01:05:12,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:12,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:05:12,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328207615] [2019-10-15 01:05:12,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:05:12,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:05:12,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:12,798 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-10-15 01:05:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:13,080 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2019-10-15 01:05:13,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:13,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-10-15 01:05:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:13,086 INFO L225 Difference]: With dead ends: 105 [2019-10-15 01:05:13,086 INFO L226 Difference]: Without dead ends: 103 [2019-10-15 01:05:13,089 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-15 01:05:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-15 01:05:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-10-15 01:05:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-15 01:05:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-10-15 01:05:13,132 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-10-15 01:05:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:13,132 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-10-15 01:05:13,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:05:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-10-15 01:05:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:05:13,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:13,135 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:13,135 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-10-15 01:05:13,136 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:13,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093292582] [2019-10-15 01:05:13,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:13,221 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-15 01:05:13,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093292582] [2019-10-15 01:05:13,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:13,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:13,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948906832] [2019-10-15 01:05:13,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:13,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:13,224 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-10-15 01:05:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:13,322 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2019-10-15 01:05:13,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:13,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-15 01:05:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:13,330 INFO L225 Difference]: With dead ends: 106 [2019-10-15 01:05:13,331 INFO L226 Difference]: Without dead ends: 104 [2019-10-15 01:05:13,331 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-15 01:05:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-15 01:05:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-10-15 01:05:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-15 01:05:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-10-15 01:05:13,380 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-10-15 01:05:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:13,380 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-10-15 01:05:13,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-10-15 01:05:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:05:13,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:13,383 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:13,383 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-10-15 01:05:13,386 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:13,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750651818] [2019-10-15 01:05:13,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:13,473 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-15 01:05:13,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750651818] [2019-10-15 01:05:13,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:13,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:13,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703059730] [2019-10-15 01:05:13,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:13,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:13,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:13,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:13,477 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-10-15 01:05:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:13,698 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-10-15 01:05:13,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:13,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-15 01:05:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:13,701 INFO L225 Difference]: With dead ends: 157 [2019-10-15 01:05:13,701 INFO L226 Difference]: Without dead ends: 155 [2019-10-15 01:05:13,702 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-15 01:05:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-15 01:05:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-10-15 01:05:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-15 01:05:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-10-15 01:05:13,753 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-10-15 01:05:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:13,754 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-10-15 01:05:13,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-10-15 01:05:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:05:13,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:13,762 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:13,762 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-10-15 01:05:13,763 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:13,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083211278] [2019-10-15 01:05:13,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:13,822 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-15 01:05:13,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083211278] [2019-10-15 01:05:13,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:13,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:13,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626130583] [2019-10-15 01:05:13,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:13,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:13,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:13,825 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-10-15 01:05:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:14,007 INFO L93 Difference]: Finished difference Result 189 states and 291 transitions. [2019-10-15 01:05:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:14,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-15 01:05:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:14,010 INFO L225 Difference]: With dead ends: 189 [2019-10-15 01:05:14,011 INFO L226 Difference]: Without dead ends: 187 [2019-10-15 01:05:14,011 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-15 01:05:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-15 01:05:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-10-15 01:05:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-15 01:05:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-10-15 01:05:14,036 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-10-15 01:05:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:14,036 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-10-15 01:05:14,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-10-15 01:05:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:05:14,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:14,038 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:14,038 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-10-15 01:05:14,039 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:14,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725522042] [2019-10-15 01:05:14,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:14,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:14,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:14,055 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-15 01:05:14,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725522042] [2019-10-15 01:05:14,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:14,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:05:14,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687443325] [2019-10-15 01:05:14,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:05:14,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:14,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:05:14,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:05:14,057 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-10-15 01:05:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:14,114 INFO L93 Difference]: Finished difference Result 309 states and 481 transitions. [2019-10-15 01:05:14,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:05:14,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:05:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:14,120 INFO L225 Difference]: With dead ends: 309 [2019-10-15 01:05:14,120 INFO L226 Difference]: Without dead ends: 232 [2019-10-15 01:05:14,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:05:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-15 01:05:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-10-15 01:05:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-15 01:05:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-10-15 01:05:14,168 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-10-15 01:05:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:14,170 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-10-15 01:05:14,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:05:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-10-15 01:05:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:05:14,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:14,173 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, 1] [2019-10-15 01:05:14,173 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-10-15 01:05:14,174 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:14,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310099541] [2019-10-15 01:05:14,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:14,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:14,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:14,262 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-15 01:05:14,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310099541] [2019-10-15 01:05:14,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:14,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:14,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447633913] [2019-10-15 01:05:14,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:14,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:14,265 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-10-15 01:05:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:14,436 INFO L93 Difference]: Finished difference Result 276 states and 448 transitions. [2019-10-15 01:05:14,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:14,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-15 01:05:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:14,440 INFO L225 Difference]: With dead ends: 276 [2019-10-15 01:05:14,440 INFO L226 Difference]: Without dead ends: 274 [2019-10-15 01:05:14,441 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-15 01:05:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-15 01:05:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 244. [2019-10-15 01:05:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-10-15 01:05:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 393 transitions. [2019-10-15 01:05:14,479 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 393 transitions. Word has length 26 [2019-10-15 01:05:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:14,479 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 393 transitions. [2019-10-15 01:05:14,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 393 transitions. [2019-10-15 01:05:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:05:14,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:14,481 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, 1] [2019-10-15 01:05:14,481 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:14,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:14,486 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-10-15 01:05:14,486 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:14,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577395755] [2019-10-15 01:05:14,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:14,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:14,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:05:14,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577395755] [2019-10-15 01:05:14,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983839040] [2019-10-15 01:05:14,608 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-15 01:05:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:14,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-15 01:05:14,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:14,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:14,758 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-15 01:05:14,758 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:14,831 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-15 01:05:14,831 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:05:14,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [10] total 15 [2019-10-15 01:05:14,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943242928] [2019-10-15 01:05:14,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:05:14,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:14,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:05:14,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:05:14,833 INFO L87 Difference]: Start difference. First operand 244 states and 393 transitions. Second operand 10 states. [2019-10-15 01:05:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:15,042 INFO L93 Difference]: Finished difference Result 251 states and 399 transitions. [2019-10-15 01:05:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:15,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-10-15 01:05:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:15,045 INFO L225 Difference]: With dead ends: 251 [2019-10-15 01:05:15,046 INFO L226 Difference]: Without dead ends: 249 [2019-10-15 01:05:15,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:05:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-15 01:05:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-10-15 01:05:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-15 01:05:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 396 transitions. [2019-10-15 01:05:15,084 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 396 transitions. Word has length 28 [2019-10-15 01:05:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:15,085 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 396 transitions. [2019-10-15 01:05:15,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:05:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 396 transitions. [2019-10-15 01:05:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:05:15,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:15,086 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, 1] [2019-10-15 01:05:15,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:15,294 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:15,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:15,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-10-15 01:05:15,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:15,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570497939] [2019-10-15 01:05:15,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:15,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:15,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:15,349 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-15 01:05:15,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570497939] [2019-10-15 01:05:15,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:15,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:05:15,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518246711] [2019-10-15 01:05:15,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:05:15,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:15,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:05:15,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:15,351 INFO L87 Difference]: Start difference. First operand 248 states and 396 transitions. Second operand 7 states. [2019-10-15 01:05:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:15,634 INFO L93 Difference]: Finished difference Result 417 states and 695 transitions. [2019-10-15 01:05:15,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:15,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-15 01:05:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:15,640 INFO L225 Difference]: With dead ends: 417 [2019-10-15 01:05:15,641 INFO L226 Difference]: Without dead ends: 415 [2019-10-15 01:05:15,641 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-15 01:05:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-10-15 01:05:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 371. [2019-10-15 01:05:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-10-15 01:05:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 617 transitions. [2019-10-15 01:05:15,702 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 617 transitions. Word has length 31 [2019-10-15 01:05:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:15,702 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 617 transitions. [2019-10-15 01:05:15,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:05:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 617 transitions. [2019-10-15 01:05:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:05:15,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:15,704 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, 1] [2019-10-15 01:05:15,704 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:15,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1955682911, now seen corresponding path program 1 times [2019-10-15 01:05:15,705 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:15,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590898404] [2019-10-15 01:05:15,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:15,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:15,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:15,760 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-15 01:05:15,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590898404] [2019-10-15 01:05:15,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:15,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:05:15,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000115393] [2019-10-15 01:05:15,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:05:15,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:15,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:05:15,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:15,762 INFO L87 Difference]: Start difference. First operand 371 states and 617 transitions. Second operand 7 states. [2019-10-15 01:05:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:16,029 INFO L93 Difference]: Finished difference Result 392 states and 648 transitions. [2019-10-15 01:05:16,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:16,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-15 01:05:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:16,033 INFO L225 Difference]: With dead ends: 392 [2019-10-15 01:05:16,033 INFO L226 Difference]: Without dead ends: 390 [2019-10-15 01:05:16,034 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-15 01:05:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-10-15 01:05:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2019-10-15 01:05:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-10-15 01:05:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 626 transitions. [2019-10-15 01:05:16,074 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 626 transitions. Word has length 31 [2019-10-15 01:05:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:16,074 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 626 transitions. [2019-10-15 01:05:16,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:05:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 626 transitions. [2019-10-15 01:05:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:05:16,076 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:16,076 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:16,076 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1751188594, now seen corresponding path program 1 times [2019-10-15 01:05:16,077 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:16,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73229301] [2019-10-15 01:05:16,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:16,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:16,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:05:16,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73229301] [2019-10-15 01:05:16,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57406008] [2019-10-15 01:05:16,145 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-15 01:05:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:16,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-15 01:05:16,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:16,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:05:16,282 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:05:16,316 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:05:16,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 14 [2019-10-15 01:05:16,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896147346] [2019-10-15 01:05:16,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:05:16,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:16,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:05:16,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:05:16,318 INFO L87 Difference]: Start difference. First operand 378 states and 626 transitions. Second operand 9 states. [2019-10-15 01:05:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:16,526 INFO L93 Difference]: Finished difference Result 440 states and 727 transitions. [2019-10-15 01:05:16,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:05:16,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-10-15 01:05:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:16,531 INFO L225 Difference]: With dead ends: 440 [2019-10-15 01:05:16,531 INFO L226 Difference]: Without dead ends: 438 [2019-10-15 01:05:16,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:05:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-10-15 01:05:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 382. [2019-10-15 01:05:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-15 01:05:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 629 transitions. [2019-10-15 01:05:16,575 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 629 transitions. Word has length 40 [2019-10-15 01:05:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:16,576 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 629 transitions. [2019-10-15 01:05:16,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:05:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 629 transitions. [2019-10-15 01:05:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:05:16,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:16,578 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, 1, 1] [2019-10-15 01:05:16,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:16,791 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-10-15 01:05:16,792 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:16,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565387195] [2019-10-15 01:05:16,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:16,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:16,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:16,848 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-15 01:05:16,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565387195] [2019-10-15 01:05:16,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:16,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:05:16,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996225669] [2019-10-15 01:05:16,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:05:16,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:05:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:16,851 INFO L87 Difference]: Start difference. First operand 382 states and 629 transitions. Second operand 7 states. [2019-10-15 01:05:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:17,074 INFO L93 Difference]: Finished difference Result 435 states and 701 transitions. [2019-10-15 01:05:17,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:17,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-15 01:05:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:17,079 INFO L225 Difference]: With dead ends: 435 [2019-10-15 01:05:17,079 INFO L226 Difference]: Without dead ends: 433 [2019-10-15 01:05:17,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:05:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-15 01:05:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 312. [2019-10-15 01:05:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-15 01:05:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 499 transitions. [2019-10-15 01:05:17,126 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 499 transitions. Word has length 41 [2019-10-15 01:05:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:17,126 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 499 transitions. [2019-10-15 01:05:17,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:05:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 499 transitions. [2019-10-15 01:05:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 01:05:17,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:17,129 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, 1] [2019-10-15 01:05:17,130 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-10-15 01:05:17,131 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:17,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317546034] [2019-10-15 01:05:17,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:17,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:17,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:17,223 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-15 01:05:17,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317546034] [2019-10-15 01:05:17,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827488715] [2019-10-15 01:05:17,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:17,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:05:17,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:17,444 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-15 01:05:17,444 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:17,579 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-15 01:05:17,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:05:17,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 6] total 15 [2019-10-15 01:05:17,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639373685] [2019-10-15 01:05:17,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:17,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:17,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:05:17,582 INFO L87 Difference]: Start difference. First operand 312 states and 499 transitions. Second operand 6 states. [2019-10-15 01:05:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:17,906 INFO L93 Difference]: Finished difference Result 679 states and 1090 transitions. [2019-10-15 01:05:17,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:05:17,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-15 01:05:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:17,909 INFO L225 Difference]: With dead ends: 679 [2019-10-15 01:05:17,910 INFO L226 Difference]: Without dead ends: 395 [2019-10-15 01:05:17,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:05:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-15 01:05:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 360. [2019-10-15 01:05:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-15 01:05:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 583 transitions. [2019-10-15 01:05:17,970 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 583 transitions. Word has length 61 [2019-10-15 01:05:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:17,971 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 583 transitions. [2019-10-15 01:05:17,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 583 transitions. [2019-10-15 01:05:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-15 01:05:17,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:17,974 INFO L380 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:18,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:18,179 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:18,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1184410446, now seen corresponding path program 1 times [2019-10-15 01:05:18,180 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:18,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664915010] [2019-10-15 01:05:18,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:18,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:18,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-15 01:05:18,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664915010] [2019-10-15 01:05:18,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874915062] [2019-10-15 01:05:18,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:18,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:05:18,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-15 01:05:18,757 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-15 01:05:37,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1328461147] [2019-10-15 01:05:37,128 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 76 [2019-10-15 01:05:37,162 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:05:37,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:05:37,230 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:05:37,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:05:37,354 INFO L272 AbstractInterpreter]: Visited 37 different actions 136 times. Merged at 15 different actions 15 times. Never widened. Performed 159 root evaluator evaluations with a maximum evaluation depth of 8. Performed 159 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 3 fixpoints after 2 different actions. Largest state had 15 variables. [2019-10-15 01:05:37,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:37,361 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:05:37,361 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:37,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2019-10-15 01:05:37,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484200968] [2019-10-15 01:05:37,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 01:05:37,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 01:05:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=532, Unknown=4, NotChecked=0, Total=600 [2019-10-15 01:05:37,364 INFO L87 Difference]: Start difference. First operand 360 states and 583 transitions. Second operand 25 states. [2019-10-15 01:05:47,471 WARN L191 SmtUtils]: Spent 9.93 s on a formula simplification. DAG size of input: 28 DAG size of output: 23