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/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:45,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:45,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:45,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:45,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:45,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:45,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:45,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:45,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:45,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:45,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:45,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:45,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:45,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:45,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:45,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:45,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:45,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:45,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:45,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:45,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:45,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:45,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:45,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:45,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:45,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:45,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:45,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:45,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:45,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:45,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:45,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:45,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:45,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:45,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:45,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:45,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:45,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:45,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:45,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:45,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:45,674 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:23:45,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:45,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:45,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:45,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:45,695 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:45,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:45,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:45,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:45,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:45,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:45,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:45,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:45,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:45,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:45,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:45,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:45,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:45,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:45,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:45,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:45,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:45,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:45,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:45,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:45,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:45,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:45,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:45,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:45,701 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:23:45,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:45,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:45,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:45,991 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:45,991 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:45,992 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:23:46,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3b73fb3/b9b595a6b20540bcbbf06cf90ef58edd/FLAG2af5d1c9a [2019-10-15 01:23:46,654 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:46,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:23:46,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3b73fb3/b9b595a6b20540bcbbf06cf90ef58edd/FLAG2af5d1c9a [2019-10-15 01:23:46,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3b73fb3/b9b595a6b20540bcbbf06cf90ef58edd [2019-10-15 01:23:46,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:46,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:46,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:46,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:46,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:46,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:46" (1/1) ... [2019-10-15 01:23:46,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5d4e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:46, skipping insertion in model container [2019-10-15 01:23:46,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:46" (1/1) ... [2019-10-15 01:23:46,951 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:47,028 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:47,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:47,571 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:47,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:47,972 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:47,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47 WrapperNode [2019-10-15 01:23:47,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:47,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:47,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:47,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:47,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (1/1) ... [2019-10-15 01:23:47,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (1/1) ... [2019-10-15 01:23:48,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (1/1) ... [2019-10-15 01:23:48,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (1/1) ... [2019-10-15 01:23:48,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (1/1) ... [2019-10-15 01:23:48,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (1/1) ... [2019-10-15 01:23:48,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (1/1) ... [2019-10-15 01:23:48,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:48,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:48,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:48,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:48,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (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:23:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:48,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:48,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:48,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:49,444 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:49,445 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:49,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:49 BoogieIcfgContainer [2019-10-15 01:23:49,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:49,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:49,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:49,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:49,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:46" (1/3) ... [2019-10-15 01:23:49,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4069b2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:49, skipping insertion in model container [2019-10-15 01:23:49,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (2/3) ... [2019-10-15 01:23:49,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4069b2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:49, skipping insertion in model container [2019-10-15 01:23:49,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:49" (3/3) ... [2019-10-15 01:23:49,455 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:23:49,467 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:49,476 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:23:49,487 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:23:49,517 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:49,517 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:49,518 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:49,518 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:49,518 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:49,518 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:49,518 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:49,518 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2019-10-15 01:23:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:23:49,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:49,581 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:49,583 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:49,589 INFO L82 PathProgramCache]: Analyzing trace with hash 424996304, now seen corresponding path program 1 times [2019-10-15 01:23:49,599 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:49,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228091703] [2019-10-15 01:23:49,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:50,328 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:23:50,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228091703] [2019-10-15 01:23:50,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:50,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:50,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980786509] [2019-10-15 01:23:50,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:50,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:50,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:50,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:50,363 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 3 states. [2019-10-15 01:23:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:50,625 INFO L93 Difference]: Finished difference Result 655 states and 1134 transitions. [2019-10-15 01:23:50,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:50,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-15 01:23:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:50,662 INFO L225 Difference]: With dead ends: 655 [2019-10-15 01:23:50,662 INFO L226 Difference]: Without dead ends: 540 [2019-10-15 01:23:50,672 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:23:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-15 01:23:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-10-15 01:23:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-15 01:23:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 803 transitions. [2019-10-15 01:23:50,826 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 803 transitions. Word has length 157 [2019-10-15 01:23:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:50,830 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 803 transitions. [2019-10-15 01:23:50,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 803 transitions. [2019-10-15 01:23:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:23:50,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:50,844 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:50,844 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:50,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1469457116, now seen corresponding path program 1 times [2019-10-15 01:23:50,846 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:50,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186535017] [2019-10-15 01:23:50,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:51,281 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:23:51,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186535017] [2019-10-15 01:23:51,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:51,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:51,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251263905] [2019-10-15 01:23:51,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:51,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:51,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:51,285 INFO L87 Difference]: Start difference. First operand 538 states and 803 transitions. Second operand 4 states. [2019-10-15 01:23:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:51,437 INFO L93 Difference]: Finished difference Result 1561 states and 2326 transitions. [2019-10-15 01:23:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:51,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-15 01:23:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:51,445 INFO L225 Difference]: With dead ends: 1561 [2019-10-15 01:23:51,445 INFO L226 Difference]: Without dead ends: 1036 [2019-10-15 01:23:51,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-10-15 01:23:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2019-10-15 01:23:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-15 01:23:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1529 transitions. [2019-10-15 01:23:51,501 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1529 transitions. Word has length 157 [2019-10-15 01:23:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:51,501 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1529 transitions. [2019-10-15 01:23:51,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1529 transitions. [2019-10-15 01:23:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:23:51,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:51,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:51,505 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:51,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash -790671312, now seen corresponding path program 1 times [2019-10-15 01:23:51,506 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:51,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856798318] [2019-10-15 01:23:51,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:51,586 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:23:51,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856798318] [2019-10-15 01:23:51,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:51,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:51,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575894204] [2019-10-15 01:23:51,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:51,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:51,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:51,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:51,589 INFO L87 Difference]: Start difference. First operand 1034 states and 1529 transitions. Second operand 3 states. [2019-10-15 01:23:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:51,701 INFO L93 Difference]: Finished difference Result 3056 states and 4517 transitions. [2019-10-15 01:23:51,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:51,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-15 01:23:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:51,718 INFO L225 Difference]: With dead ends: 3056 [2019-10-15 01:23:51,718 INFO L226 Difference]: Without dead ends: 2054 [2019-10-15 01:23:51,722 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:23:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2019-10-15 01:23:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1036. [2019-10-15 01:23:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-10-15 01:23:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1531 transitions. [2019-10-15 01:23:51,816 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1531 transitions. Word has length 158 [2019-10-15 01:23:51,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:51,817 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1531 transitions. [2019-10-15 01:23:51,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1531 transitions. [2019-10-15 01:23:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:23:51,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:51,822 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:51,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:51,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:51,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1966932605, now seen corresponding path program 1 times [2019-10-15 01:23:51,824 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:51,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33216176] [2019-10-15 01:23:51,824 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,119 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:23:52,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33216176] [2019-10-15 01:23:52,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:52,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548031584] [2019-10-15 01:23:52,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:52,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:52,123 INFO L87 Difference]: Start difference. First operand 1036 states and 1531 transitions. Second operand 4 states. [2019-10-15 01:23:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:52,205 INFO L93 Difference]: Finished difference Result 2054 states and 3037 transitions. [2019-10-15 01:23:52,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:52,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-15 01:23:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:52,212 INFO L225 Difference]: With dead ends: 2054 [2019-10-15 01:23:52,213 INFO L226 Difference]: Without dead ends: 1036 [2019-10-15 01:23:52,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-10-15 01:23:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1035. [2019-10-15 01:23:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-10-15 01:23:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1528 transitions. [2019-10-15 01:23:52,280 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1528 transitions. Word has length 159 [2019-10-15 01:23:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:52,281 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1528 transitions. [2019-10-15 01:23:52,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1528 transitions. [2019-10-15 01:23:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:23:52,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:52,284 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:52,285 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash 745680526, now seen corresponding path program 1 times [2019-10-15 01:23:52,285 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:52,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320888604] [2019-10-15 01:23:52,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,439 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:23:52,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320888604] [2019-10-15 01:23:52,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:52,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129517623] [2019-10-15 01:23:52,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:52,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:52,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:52,444 INFO L87 Difference]: Start difference. First operand 1035 states and 1528 transitions. Second operand 3 states. [2019-10-15 01:23:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:52,631 INFO L93 Difference]: Finished difference Result 2834 states and 4197 transitions. [2019-10-15 01:23:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:52,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-15 01:23:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:52,649 INFO L225 Difference]: With dead ends: 2834 [2019-10-15 01:23:52,649 INFO L226 Difference]: Without dead ends: 1997 [2019-10-15 01:23:52,703 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:23:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-10-15 01:23:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1995. [2019-10-15 01:23:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-10-15 01:23:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2918 transitions. [2019-10-15 01:23:52,806 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2918 transitions. Word has length 159 [2019-10-15 01:23:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:52,806 INFO L462 AbstractCegarLoop]: Abstraction has 1995 states and 2918 transitions. [2019-10-15 01:23:52,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2918 transitions. [2019-10-15 01:23:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:23:52,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:52,811 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:52,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:52,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1379415471, now seen corresponding path program 1 times [2019-10-15 01:23:52,812 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:52,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447350114] [2019-10-15 01:23:52,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,978 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:23:52,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447350114] [2019-10-15 01:23:52,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:52,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373808913] [2019-10-15 01:23:52,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:52,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:52,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:52,981 INFO L87 Difference]: Start difference. First operand 1995 states and 2918 transitions. Second operand 4 states. [2019-10-15 01:23:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,090 INFO L93 Difference]: Finished difference Result 3337 states and 4898 transitions. [2019-10-15 01:23:53,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:53,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-15 01:23:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,099 INFO L225 Difference]: With dead ends: 3337 [2019-10-15 01:23:53,100 INFO L226 Difference]: Without dead ends: 1528 [2019-10-15 01:23:53,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2019-10-15 01:23:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2019-10-15 01:23:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-10-15 01:23:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2228 transitions. [2019-10-15 01:23:53,187 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2228 transitions. Word has length 159 [2019-10-15 01:23:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:53,187 INFO L462 AbstractCegarLoop]: Abstraction has 1528 states and 2228 transitions. [2019-10-15 01:23:53,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2228 transitions. [2019-10-15 01:23:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:23:53,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:53,192 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:53,192 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:53,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash -51426036, now seen corresponding path program 1 times [2019-10-15 01:23:53,193 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:53,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020306598] [2019-10-15 01:23:53,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,309 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:23:53,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020306598] [2019-10-15 01:23:53,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:53,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103732981] [2019-10-15 01:23:53,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:53,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:53,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,312 INFO L87 Difference]: Start difference. First operand 1528 states and 2228 transitions. Second operand 3 states. [2019-10-15 01:23:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,465 INFO L93 Difference]: Finished difference Result 3607 states and 5375 transitions. [2019-10-15 01:23:53,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:53,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-15 01:23:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,480 INFO L225 Difference]: With dead ends: 3607 [2019-10-15 01:23:53,481 INFO L226 Difference]: Without dead ends: 2268 [2019-10-15 01:23:53,485 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:23:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-10-15 01:23:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1952. [2019-10-15 01:23:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-10-15 01:23:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2916 transitions. [2019-10-15 01:23:53,606 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2916 transitions. Word has length 161 [2019-10-15 01:23:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:53,607 INFO L462 AbstractCegarLoop]: Abstraction has 1952 states and 2916 transitions. [2019-10-15 01:23:53,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2916 transitions. [2019-10-15 01:23:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:23:53,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:53,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:53,611 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:53,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:53,611 INFO L82 PathProgramCache]: Analyzing trace with hash -541662678, now seen corresponding path program 1 times [2019-10-15 01:23:53,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:53,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531156284] [2019-10-15 01:23:53,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,723 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:23:53,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531156284] [2019-10-15 01:23:53,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:53,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850445336] [2019-10-15 01:23:53,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:53,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,726 INFO L87 Difference]: Start difference. First operand 1952 states and 2916 transitions. Second operand 3 states. [2019-10-15 01:23:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,914 INFO L93 Difference]: Finished difference Result 4665 states and 7121 transitions. [2019-10-15 01:23:53,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:53,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-15 01:23:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,931 INFO L225 Difference]: With dead ends: 4665 [2019-10-15 01:23:53,931 INFO L226 Difference]: Without dead ends: 2986 [2019-10-15 01:23:53,935 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:23:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-10-15 01:23:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2706. [2019-10-15 01:23:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-10-15 01:23:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4137 transitions. [2019-10-15 01:23:54,127 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4137 transitions. Word has length 163 [2019-10-15 01:23:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:54,127 INFO L462 AbstractCegarLoop]: Abstraction has 2706 states and 4137 transitions. [2019-10-15 01:23:54,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4137 transitions. [2019-10-15 01:23:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:23:54,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:54,131 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:54,132 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 911873176, now seen corresponding path program 1 times [2019-10-15 01:23:54,133 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:54,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305466230] [2019-10-15 01:23:54,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:54,339 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:23:54,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305466230] [2019-10-15 01:23:54,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:54,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:54,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443232722] [2019-10-15 01:23:54,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:54,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:54,343 INFO L87 Difference]: Start difference. First operand 2706 states and 4137 transitions. Second operand 5 states. [2019-10-15 01:23:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:55,183 INFO L93 Difference]: Finished difference Result 7601 states and 11754 transitions. [2019-10-15 01:23:55,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:55,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-10-15 01:23:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:55,218 INFO L225 Difference]: With dead ends: 7601 [2019-10-15 01:23:55,219 INFO L226 Difference]: Without dead ends: 5078 [2019-10-15 01:23:55,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-10-15 01:23:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5076. [2019-10-15 01:23:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-10-15 01:23:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7791 transitions. [2019-10-15 01:23:55,650 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7791 transitions. Word has length 164 [2019-10-15 01:23:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,650 INFO L462 AbstractCegarLoop]: Abstraction has 5076 states and 7791 transitions. [2019-10-15 01:23:55,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7791 transitions. [2019-10-15 01:23:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:23:55,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,656 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:55,656 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2112908957, now seen corresponding path program 1 times [2019-10-15 01:23:55,657 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127194828] [2019-10-15 01:23:55,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:55,909 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:23:55,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127194828] [2019-10-15 01:23:55,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:55,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:55,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783398335] [2019-10-15 01:23:55,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:55,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:55,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:55,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:55,913 INFO L87 Difference]: Start difference. First operand 5076 states and 7791 transitions. Second operand 4 states. [2019-10-15 01:23:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:56,638 INFO L93 Difference]: Finished difference Result 13239 states and 20333 transitions. [2019-10-15 01:23:56,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:56,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-15 01:23:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:56,683 INFO L225 Difference]: With dead ends: 13239 [2019-10-15 01:23:56,684 INFO L226 Difference]: Without dead ends: 8194 [2019-10-15 01:23:56,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states. [2019-10-15 01:23:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8192. [2019-10-15 01:23:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8192 states. [2019-10-15 01:23:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 12471 transitions. [2019-10-15 01:23:57,412 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 12471 transitions. Word has length 164 [2019-10-15 01:23:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:57,413 INFO L462 AbstractCegarLoop]: Abstraction has 8192 states and 12471 transitions. [2019-10-15 01:23:57,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 12471 transitions. [2019-10-15 01:23:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:23:57,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:57,425 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:57,425 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1008257189, now seen corresponding path program 1 times [2019-10-15 01:23:57,427 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:57,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602088658] [2019-10-15 01:23:57,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,604 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:23:57,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602088658] [2019-10-15 01:23:57,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:57,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660451483] [2019-10-15 01:23:57,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:57,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:57,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:57,608 INFO L87 Difference]: Start difference. First operand 8192 states and 12471 transitions. Second operand 3 states. [2019-10-15 01:23:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:58,605 INFO L93 Difference]: Finished difference Result 20555 states and 31330 transitions. [2019-10-15 01:23:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:58,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-15 01:23:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:58,639 INFO L225 Difference]: With dead ends: 20555 [2019-10-15 01:23:58,639 INFO L226 Difference]: Without dead ends: 12739 [2019-10-15 01:23:58,655 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:23:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2019-10-15 01:23:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 12737. [2019-10-15 01:23:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12737 states. [2019-10-15 01:23:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 19158 transitions. [2019-10-15 01:23:59,548 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 19158 transitions. Word has length 166 [2019-10-15 01:23:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:59,549 INFO L462 AbstractCegarLoop]: Abstraction has 12737 states and 19158 transitions. [2019-10-15 01:23:59,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 19158 transitions. [2019-10-15 01:23:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-15 01:23:59,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:59,559 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:59,560 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1356015054, now seen corresponding path program 1 times [2019-10-15 01:23:59,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:59,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843264836] [2019-10-15 01:23:59,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:59,659 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:23:59,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843264836] [2019-10-15 01:23:59,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:59,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:59,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031518581] [2019-10-15 01:23:59,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:59,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:59,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:59,661 INFO L87 Difference]: Start difference. First operand 12737 states and 19158 transitions. Second operand 3 states. [2019-10-15 01:24:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:01,302 INFO L93 Difference]: Finished difference Result 33839 states and 51503 transitions. [2019-10-15 01:24:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:01,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-15 01:24:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:01,352 INFO L225 Difference]: With dead ends: 33839 [2019-10-15 01:24:01,353 INFO L226 Difference]: Without dead ends: 21443 [2019-10-15 01:24:01,375 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:24:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21443 states. [2019-10-15 01:24:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21443 to 19533. [2019-10-15 01:24:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-10-15 01:24:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 29933 transitions. [2019-10-15 01:24:02,455 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 29933 transitions. Word has length 170 [2019-10-15 01:24:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:02,456 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 29933 transitions. [2019-10-15 01:24:02,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 29933 transitions. [2019-10-15 01:24:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-15 01:24:02,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:02,467 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:02,468 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:02,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash -927051742, now seen corresponding path program 1 times [2019-10-15 01:24:02,469 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:02,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314456065] [2019-10-15 01:24:02,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:02,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:02,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:02,712 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:24:02,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314456065] [2019-10-15 01:24:02,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:02,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:24:02,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344588213] [2019-10-15 01:24:02,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:24:02,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:02,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:24:02,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:24:02,716 INFO L87 Difference]: Start difference. First operand 19533 states and 29933 transitions. Second operand 8 states. [2019-10-15 01:24:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:07,274 INFO L93 Difference]: Finished difference Result 80177 states and 123376 transitions. [2019-10-15 01:24:07,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:24:07,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2019-10-15 01:24:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:07,438 INFO L225 Difference]: With dead ends: 80177 [2019-10-15 01:24:07,439 INFO L226 Difference]: Without dead ends: 61059 [2019-10-15 01:24:07,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:24:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61059 states. [2019-10-15 01:24:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61059 to 32625. [2019-10-15 01:24:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32625 states. [2019-10-15 01:24:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32625 states to 32625 states and 49361 transitions. [2019-10-15 01:24:09,441 INFO L78 Accepts]: Start accepts. Automaton has 32625 states and 49361 transitions. Word has length 171 [2019-10-15 01:24:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:09,441 INFO L462 AbstractCegarLoop]: Abstraction has 32625 states and 49361 transitions. [2019-10-15 01:24:09,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:24:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32625 states and 49361 transitions. [2019-10-15 01:24:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-15 01:24:09,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:09,455 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:09,455 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash 299202232, now seen corresponding path program 1 times [2019-10-15 01:24:09,456 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:09,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415263999] [2019-10-15 01:24:09,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:09,691 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:24:09,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415263999] [2019-10-15 01:24:09,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:09,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:09,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396745507] [2019-10-15 01:24:09,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:09,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:09,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:09,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:09,694 INFO L87 Difference]: Start difference. First operand 32625 states and 49361 transitions. Second operand 4 states. [2019-10-15 01:24:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:12,726 INFO L93 Difference]: Finished difference Result 90603 states and 136692 transitions. [2019-10-15 01:24:12,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:12,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-10-15 01:24:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:12,845 INFO L225 Difference]: With dead ends: 90603 [2019-10-15 01:24:12,846 INFO L226 Difference]: Without dead ends: 58021 [2019-10-15 01:24:12,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58021 states. [2019-10-15 01:24:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58021 to 58019. [2019-10-15 01:24:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58019 states. [2019-10-15 01:24:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58019 states to 58019 states and 86398 transitions. [2019-10-15 01:24:16,730 INFO L78 Accepts]: Start accepts. Automaton has 58019 states and 86398 transitions. Word has length 171 [2019-10-15 01:24:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:16,730 INFO L462 AbstractCegarLoop]: Abstraction has 58019 states and 86398 transitions. [2019-10-15 01:24:16,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 58019 states and 86398 transitions. [2019-10-15 01:24:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-15 01:24:16,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:16,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,750 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:16,751 INFO L82 PathProgramCache]: Analyzing trace with hash -996193854, now seen corresponding path program 1 times [2019-10-15 01:24:16,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:16,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453966739] [2019-10-15 01:24:16,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:16,813 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:24:16,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453966739] [2019-10-15 01:24:16,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:16,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:16,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034032494] [2019-10-15 01:24:16,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:16,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:16,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:16,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:16,816 INFO L87 Difference]: Start difference. First operand 58019 states and 86398 transitions. Second operand 3 states.