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/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:24:21,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:24:21,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:24:21,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:24:21,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:24:21,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:24:21,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:24:21,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:24:21,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:24:21,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:24:21,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:24:21,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:24:21,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:24:21,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:24:21,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:24:21,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:24:21,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:24:21,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:24:21,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:24:21,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:24:21,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:24:21,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:24:21,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:24:21,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:24:21,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:24:21,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:24:21,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:24:21,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:24:21,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:24:21,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:24:21,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:24:21,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:24:21,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:24:21,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:24:21,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:24:21,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:24:21,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:24:21,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:24:21,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:24:21,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:24:21,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:24:21,723 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:24:21,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:24:21,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:24:21,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:24:21,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:24:21,753 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:24:21,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:24:21,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:24:21,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:24:21,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:24:21,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:24:21,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:24:21,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:24:21,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:24:21,757 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:24:21,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:24:21,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:24:21,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:24:21,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:24:21,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:24:21,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:24:21,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:24:21,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:24:21,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:24:21,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:24:21,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:24:21,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:24:21,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:24:21,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:24:21,761 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:24:22,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:24:22,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:24:22,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:24:22,112 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:24:22,112 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:24:22,113 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-15 01:24:22,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32b6e9c5/1a037093f1aa4a5b968714a80195b801/FLAG89f2ddb98 [2019-10-15 01:24:22,730 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:24:22,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-15 01:24:22,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32b6e9c5/1a037093f1aa4a5b968714a80195b801/FLAG89f2ddb98 [2019-10-15 01:24:23,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32b6e9c5/1a037093f1aa4a5b968714a80195b801 [2019-10-15 01:24:23,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:24:23,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:24:23,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:23,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:24:23,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:24:23,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:23" (1/1) ... [2019-10-15 01:24:23,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438e2e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23, skipping insertion in model container [2019-10-15 01:24:23,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:23" (1/1) ... [2019-10-15 01:24:23,066 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:24:23,123 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:24:23,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:23,495 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:24:23,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:23,589 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:24:23,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23 WrapperNode [2019-10-15 01:24:23,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:23,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:24:23,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:24:23,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:24:23,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23" (1/1) ... [2019-10-15 01:24:23,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23" (1/1) ... [2019-10-15 01:24:23,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23" (1/1) ... [2019-10-15 01:24:23,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23" (1/1) ... [2019-10-15 01:24:23,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23" (1/1) ... [2019-10-15 01:24:23,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23" (1/1) ... [2019-10-15 01:24:23,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23" (1/1) ... [2019-10-15 01:24:23,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:24:23,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:24:23,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:24:23,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:24:23,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23" (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:24:23,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:24:23,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:24:23,720 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-15 01:24:23,720 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-15 01:24:23,720 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-15 01:24:23,720 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-15 01:24:23,720 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-15 01:24:23,721 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 01:24:23,721 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 01:24:23,721 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-15 01:24:23,721 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-15 01:24:23,721 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-15 01:24:23,721 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-15 01:24:23,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:24:23,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 01:24:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:24:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:24:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:24:23,723 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:24:23,723 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:24:23,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:24:23,723 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:24:23,723 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-15 01:24:23,723 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-15 01:24:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-15 01:24:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-15 01:24:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-15 01:24:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:24:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:24:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-15 01:24:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-15 01:24:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-15 01:24:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-15 01:24:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:24:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:24:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:24:24,511 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:24:24,511 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 01:24:24,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:24 BoogieIcfgContainer [2019-10-15 01:24:24,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:24:24,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:24:24,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:24:24,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:24:24,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:24:23" (1/3) ... [2019-10-15 01:24:24,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e83e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:24, skipping insertion in model container [2019-10-15 01:24:24,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:23" (2/3) ... [2019-10-15 01:24:24,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e83e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:24, skipping insertion in model container [2019-10-15 01:24:24,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:24" (3/3) ... [2019-10-15 01:24:24,521 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-15 01:24:24,531 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:24:24,539 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:24:24,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:24:24,576 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:24:24,576 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:24:24,576 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:24:24,576 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:24:24,577 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:24:24,577 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:24:24,577 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:24:24,577 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:24:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-10-15 01:24:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:24:24,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,609 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] [2019-10-15 01:24:24,611 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash 310880814, now seen corresponding path program 1 times [2019-10-15 01:24:24,626 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858063781] [2019-10-15 01:24:24,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,936 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:24,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858063781] [2019-10-15 01:24:24,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:24,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408793235] [2019-10-15 01:24:24,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:24,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:24,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:24,968 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 4 states. [2019-10-15 01:24:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,146 INFO L93 Difference]: Finished difference Result 412 states and 673 transitions. [2019-10-15 01:24:25,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:25,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 01:24:25,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,165 INFO L225 Difference]: With dead ends: 412 [2019-10-15 01:24:25,165 INFO L226 Difference]: Without dead ends: 212 [2019-10-15 01:24:25,173 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:24:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-15 01:24:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-10-15 01:24:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-15 01:24:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 313 transitions. [2019-10-15 01:24:25,243 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 313 transitions. Word has length 21 [2019-10-15 01:24:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,243 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 313 transitions. [2019-10-15 01:24:25,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 313 transitions. [2019-10-15 01:24:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:24:25,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,247 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] [2019-10-15 01:24:25,247 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1405375627, now seen corresponding path program 1 times [2019-10-15 01:24:25,248 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796895228] [2019-10-15 01:24:25,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,347 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:25,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796895228] [2019-10-15 01:24:25,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:25,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761328036] [2019-10-15 01:24:25,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:25,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:25,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,351 INFO L87 Difference]: Start difference. First operand 210 states and 313 transitions. Second operand 4 states. [2019-10-15 01:24:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,447 INFO L93 Difference]: Finished difference Result 427 states and 643 transitions. [2019-10-15 01:24:25,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:25,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-15 01:24:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,451 INFO L225 Difference]: With dead ends: 427 [2019-10-15 01:24:25,451 INFO L226 Difference]: Without dead ends: 226 [2019-10-15 01:24:25,455 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:24:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-15 01:24:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2019-10-15 01:24:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-15 01:24:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 329 transitions. [2019-10-15 01:24:25,481 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 329 transitions. Word has length 22 [2019-10-15 01:24:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,482 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 329 transitions. [2019-10-15 01:24:25,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 329 transitions. [2019-10-15 01:24:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:24:25,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,485 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,485 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash -152672816, now seen corresponding path program 1 times [2019-10-15 01:24:25,486 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32793385] [2019-10-15 01:24:25,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:25,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32793385] [2019-10-15 01:24:25,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:25,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328416745] [2019-10-15 01:24:25,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:25,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:25,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:25,554 INFO L87 Difference]: Start difference. First operand 223 states and 329 transitions. Second operand 3 states. [2019-10-15 01:24:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,582 INFO L93 Difference]: Finished difference Result 459 states and 689 transitions. [2019-10-15 01:24:25,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:25,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:24:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,586 INFO L225 Difference]: With dead ends: 459 [2019-10-15 01:24:25,586 INFO L226 Difference]: Without dead ends: 252 [2019-10-15 01:24:25,588 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:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-15 01:24:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 225. [2019-10-15 01:24:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-15 01:24:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2019-10-15 01:24:25,614 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 30 [2019-10-15 01:24:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,614 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2019-10-15 01:24:25,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2019-10-15 01:24:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:24:25,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,617 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,617 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,618 INFO L82 PathProgramCache]: Analyzing trace with hash 279611359, now seen corresponding path program 1 times [2019-10-15 01:24:25,618 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580868074] [2019-10-15 01:24:25,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:25,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580868074] [2019-10-15 01:24:25,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:25,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428240396] [2019-10-15 01:24:25,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:25,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:25,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,705 INFO L87 Difference]: Start difference. First operand 225 states and 331 transitions. Second operand 5 states. [2019-10-15 01:24:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,772 INFO L93 Difference]: Finished difference Result 436 states and 647 transitions. [2019-10-15 01:24:25,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:25,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-15 01:24:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,780 INFO L225 Difference]: With dead ends: 436 [2019-10-15 01:24:25,780 INFO L226 Difference]: Without dead ends: 233 [2019-10-15 01:24:25,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-15 01:24:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2019-10-15 01:24:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-15 01:24:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 335 transitions. [2019-10-15 01:24:25,831 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 335 transitions. Word has length 38 [2019-10-15 01:24:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,832 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 335 transitions. [2019-10-15 01:24:25,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 335 transitions. [2019-10-15 01:24:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:24:25,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,839 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] [2019-10-15 01:24:25,839 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,840 INFO L82 PathProgramCache]: Analyzing trace with hash -955467248, now seen corresponding path program 1 times [2019-10-15 01:24:25,840 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521075508] [2019-10-15 01:24:25,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,953 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:25,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521075508] [2019-10-15 01:24:25,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:25,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802512969] [2019-10-15 01:24:25,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:25,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,956 INFO L87 Difference]: Start difference. First operand 229 states and 335 transitions. Second operand 4 states. [2019-10-15 01:24:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,978 INFO L93 Difference]: Finished difference Result 397 states and 586 transitions. [2019-10-15 01:24:25,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:25,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-10-15 01:24:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,981 INFO L225 Difference]: With dead ends: 397 [2019-10-15 01:24:25,981 INFO L226 Difference]: Without dead ends: 225 [2019-10-15 01:24:25,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-15 01:24:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-10-15 01:24:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-15 01:24:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 326 transitions. [2019-10-15 01:24:25,997 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 326 transitions. Word has length 39 [2019-10-15 01:24:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,997 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 326 transitions. [2019-10-15 01:24:25,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 326 transitions. [2019-10-15 01:24:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:24:25,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,999 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,999 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash -13889788, now seen corresponding path program 1 times [2019-10-15 01:24:26,000 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360324630] [2019-10-15 01:24:26,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:24:26,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360324630] [2019-10-15 01:24:26,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:26,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:26,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152204715] [2019-10-15 01:24:26,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:26,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:26,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:26,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:26,063 INFO L87 Difference]: Start difference. First operand 225 states and 326 transitions. Second operand 4 states. [2019-10-15 01:24:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:26,135 INFO L93 Difference]: Finished difference Result 446 states and 656 transitions. [2019-10-15 01:24:26,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:26,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-15 01:24:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:26,141 INFO L225 Difference]: With dead ends: 446 [2019-10-15 01:24:26,141 INFO L226 Difference]: Without dead ends: 244 [2019-10-15 01:24:26,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-10-15 01:24:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-10-15 01:24:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-15 01:24:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 345 transitions. [2019-10-15 01:24:26,171 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 345 transitions. Word has length 41 [2019-10-15 01:24:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,172 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 345 transitions. [2019-10-15 01:24:26,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 345 transitions. [2019-10-15 01:24:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:24:26,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,173 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:26,174 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1194739861, now seen corresponding path program 1 times [2019-10-15 01:24:26,175 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116439838] [2019-10-15 01:24:26,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:24:26,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116439838] [2019-10-15 01:24:26,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:26,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:26,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276816473] [2019-10-15 01:24:26,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:26,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:26,265 INFO L87 Difference]: Start difference. First operand 241 states and 345 transitions. Second operand 4 states. [2019-10-15 01:24:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:26,341 INFO L93 Difference]: Finished difference Result 466 states and 684 transitions. [2019-10-15 01:24:26,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:26,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-15 01:24:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:26,347 INFO L225 Difference]: With dead ends: 466 [2019-10-15 01:24:26,347 INFO L226 Difference]: Without dead ends: 250 [2019-10-15 01:24:26,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-15 01:24:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-10-15 01:24:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-15 01:24:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 353 transitions. [2019-10-15 01:24:26,395 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 353 transitions. Word has length 41 [2019-10-15 01:24:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,396 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 353 transitions. [2019-10-15 01:24:26,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 353 transitions. [2019-10-15 01:24:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:24:26,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,397 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:26,398 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,398 INFO L82 PathProgramCache]: Analyzing trace with hash -291623798, now seen corresponding path program 1 times [2019-10-15 01:24:26,398 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797294341] [2019-10-15 01:24:26,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:24:26,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797294341] [2019-10-15 01:24:26,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:26,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:26,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011987097] [2019-10-15 01:24:26,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:26,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:26,471 INFO L87 Difference]: Start difference. First operand 248 states and 353 transitions. Second operand 5 states. [2019-10-15 01:24:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:26,505 INFO L93 Difference]: Finished difference Result 465 states and 671 transitions. [2019-10-15 01:24:26,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:26,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 01:24:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:26,508 INFO L225 Difference]: With dead ends: 465 [2019-10-15 01:24:26,508 INFO L226 Difference]: Without dead ends: 250 [2019-10-15 01:24:26,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-15 01:24:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-10-15 01:24:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-15 01:24:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2019-10-15 01:24:26,525 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 59 [2019-10-15 01:24:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,525 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2019-10-15 01:24:26,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2019-10-15 01:24:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:24:26,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,527 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:26,527 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1361992071, now seen corresponding path program 1 times [2019-10-15 01:24:26,528 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155979371] [2019-10-15 01:24:26,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:24:26,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155979371] [2019-10-15 01:24:26,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:26,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:26,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657142617] [2019-10-15 01:24:26,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:26,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:26,588 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand 4 states. [2019-10-15 01:24:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:26,655 INFO L93 Difference]: Finished difference Result 479 states and 693 transitions. [2019-10-15 01:24:26,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:26,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-15 01:24:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:26,663 INFO L225 Difference]: With dead ends: 479 [2019-10-15 01:24:26,664 INFO L226 Difference]: Without dead ends: 269 [2019-10-15 01:24:26,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:26,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-15 01:24:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-10-15 01:24:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-15 01:24:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2019-10-15 01:24:26,684 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 62 [2019-10-15 01:24:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,685 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2019-10-15 01:24:26,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2019-10-15 01:24:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:24:26,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,687 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:26,688 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1503019715, now seen corresponding path program 1 times [2019-10-15 01:24:26,688 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314900119] [2019-10-15 01:24:26,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:24:26,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314900119] [2019-10-15 01:24:26,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:26,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:26,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571437115] [2019-10-15 01:24:26,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:26,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:26,777 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand 4 states. [2019-10-15 01:24:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:26,829 INFO L93 Difference]: Finished difference Result 486 states and 697 transitions. [2019-10-15 01:24:26,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:26,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-15 01:24:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:26,832 INFO L225 Difference]: With dead ends: 486 [2019-10-15 01:24:26,833 INFO L226 Difference]: Without dead ends: 260 [2019-10-15 01:24:26,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-15 01:24:26,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-10-15 01:24:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-15 01:24:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 359 transitions. [2019-10-15 01:24:26,854 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 359 transitions. Word has length 63 [2019-10-15 01:24:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,855 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 359 transitions. [2019-10-15 01:24:26,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 359 transitions. [2019-10-15 01:24:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-15 01:24:26,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,856 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,856 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1498693946, now seen corresponding path program 1 times [2019-10-15 01:24:26,857 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798198750] [2019-10-15 01:24:26,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 01:24:26,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798198750] [2019-10-15 01:24:26,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:26,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:26,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59423868] [2019-10-15 01:24:26,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:26,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:26,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:26,919 INFO L87 Difference]: Start difference. First operand 260 states and 359 transitions. Second operand 5 states. [2019-10-15 01:24:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:26,943 INFO L93 Difference]: Finished difference Result 473 states and 664 transitions. [2019-10-15 01:24:26,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:26,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-15 01:24:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:26,946 INFO L225 Difference]: With dead ends: 473 [2019-10-15 01:24:26,946 INFO L226 Difference]: Without dead ends: 262 [2019-10-15 01:24:26,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-15 01:24:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-15 01:24:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-15 01:24:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 358 transitions. [2019-10-15 01:24:26,959 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 358 transitions. Word has length 82 [2019-10-15 01:24:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,959 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 358 transitions. [2019-10-15 01:24:26,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 358 transitions. [2019-10-15 01:24:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-15 01:24:26,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,961 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,961 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1251929143, now seen corresponding path program 1 times [2019-10-15 01:24:26,962 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849640957] [2019-10-15 01:24:26,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-15 01:24:27,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849640957] [2019-10-15 01:24:27,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:27,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:27,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737090955] [2019-10-15 01:24:27,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:27,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:27,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:27,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:27,014 INFO L87 Difference]: Start difference. First operand 260 states and 358 transitions. Second operand 4 states. [2019-10-15 01:24:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:27,101 INFO L93 Difference]: Finished difference Result 462 states and 662 transitions. [2019-10-15 01:24:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:27,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-15 01:24:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:27,105 INFO L225 Difference]: With dead ends: 462 [2019-10-15 01:24:27,105 INFO L226 Difference]: Without dead ends: 258 [2019-10-15 01:24:27,106 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:24:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-15 01:24:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-10-15 01:24:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-15 01:24:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2019-10-15 01:24:27,118 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 85 [2019-10-15 01:24:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:27,118 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2019-10-15 01:24:27,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2019-10-15 01:24:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:24:27,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:27,120 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,120 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash 599019244, now seen corresponding path program 1 times [2019-10-15 01:24:27,121 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:27,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662903136] [2019-10-15 01:24:27,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:27,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:27,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-15 01:24:27,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662903136] [2019-10-15 01:24:27,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457019486] [2019-10-15 01:24:27,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:27,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:24:27,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:24:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-15 01:24:27,402 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:24:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-15 01:24:27,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1804873904] [2019-10-15 01:24:27,543 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 101 [2019-10-15 01:24:27,591 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:24:27,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:24:27,729 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:24:27,912 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:24:27,914 INFO L272 AbstractInterpreter]: Visited 56 different actions 205 times. Merged at 16 different actions 45 times. Never widened. Performed 959 root evaluator evaluations with a maximum evaluation depth of 5. Performed 959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 1 different actions. Largest state had 89 variables. [2019-10-15 01:24:27,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:27,919 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:24:28,078 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-10-15 01:24:28,078 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:24:28,798 INFO L553 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-10-15 01:24:28,799 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:24:28,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:24:28,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 40 [2019-10-15 01:24:28,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517245145] [2019-10-15 01:24:28,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-15 01:24:28,801 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:28,801 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:24:28,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-15 01:24:28,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 01:24:28,804 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand 35 states. [2019-10-15 01:24:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:41,247 INFO L93 Difference]: Finished difference Result 621 states and 865 transitions. [2019-10-15 01:24:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-15 01:24:41,247 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-10-15 01:24:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:41,250 INFO L225 Difference]: With dead ends: 621 [2019-10-15 01:24:41,251 INFO L226 Difference]: Without dead ends: 374 [2019-10-15 01:24:41,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-10-15 01:24:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-10-15 01:24:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 306. [2019-10-15 01:24:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-15 01:24:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 404 transitions. [2019-10-15 01:24:41,274 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 404 transitions. Word has length 100 [2019-10-15 01:24:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:41,274 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 404 transitions. [2019-10-15 01:24:41,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-15 01:24:41,275 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 404 transitions. [2019-10-15 01:24:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:24:41,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:41,276 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:41,482 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:41,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:41,483 INFO L82 PathProgramCache]: Analyzing trace with hash 158839533, now seen corresponding path program 1 times [2019-10-15 01:24:41,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:41,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356080695] [2019-10-15 01:24:41,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:41,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:41,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-15 01:24:41,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356080695] [2019-10-15 01:24:41,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:41,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:41,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30917701] [2019-10-15 01:24:41,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:41,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:41,574 INFO L87 Difference]: Start difference. First operand 306 states and 404 transitions. Second operand 5 states. [2019-10-15 01:24:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:41,605 INFO L93 Difference]: Finished difference Result 477 states and 649 transitions. [2019-10-15 01:24:41,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:41,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-10-15 01:24:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:41,610 INFO L225 Difference]: With dead ends: 477 [2019-10-15 01:24:41,610 INFO L226 Difference]: Without dead ends: 306 [2019-10-15 01:24:41,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-15 01:24:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-10-15 01:24:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-15 01:24:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 399 transitions. [2019-10-15 01:24:41,630 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 399 transitions. Word has length 144 [2019-10-15 01:24:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:41,630 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 399 transitions. [2019-10-15 01:24:41,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 399 transitions. [2019-10-15 01:24:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:24:41,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:41,635 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,636 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:41,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:41,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1526725128, now seen corresponding path program 1 times [2019-10-15 01:24:41,636 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:41,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000665069] [2019-10-15 01:24:41,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:41,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:41,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-15 01:24:41,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000665069] [2019-10-15 01:24:41,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648660566] [2019-10-15 01:24:41,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:41,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:24:41,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:24:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-15 01:24:41,996 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:24:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-15 01:24:42,110 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:24:42,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:24:42,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105632728] [2019-10-15 01:24:42,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:42,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:42,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:42,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:24:42,114 INFO L87 Difference]: Start difference. First operand 306 states and 399 transitions. Second operand 3 states. [2019-10-15 01:24:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:42,140 INFO L93 Difference]: Finished difference Result 505 states and 675 transitions. [2019-10-15 01:24:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:42,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-15 01:24:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:42,144 INFO L225 Difference]: With dead ends: 505 [2019-10-15 01:24:42,145 INFO L226 Difference]: Without dead ends: 285 [2019-10-15 01:24:42,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:24:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-15 01:24:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-10-15 01:24:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-15 01:24:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 368 transitions. [2019-10-15 01:24:42,166 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 368 transitions. Word has length 153 [2019-10-15 01:24:42,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:42,167 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 368 transitions. [2019-10-15 01:24:42,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 368 transitions. [2019-10-15 01:24:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:24:42,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:42,171 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:42,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:42,375 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:42,376 INFO L82 PathProgramCache]: Analyzing trace with hash 50076921, now seen corresponding path program 1 times [2019-10-15 01:24:42,376 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:42,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637516687] [2019-10-15 01:24:42,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-15 01:24:42,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637516687] [2019-10-15 01:24:42,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:42,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:42,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236419809] [2019-10-15 01:24:42,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:42,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:42,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:42,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:42,500 INFO L87 Difference]: Start difference. First operand 285 states and 368 transitions. Second operand 4 states. [2019-10-15 01:24:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:42,544 INFO L93 Difference]: Finished difference Result 455 states and 615 transitions. [2019-10-15 01:24:42,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:42,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-15 01:24:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:42,547 INFO L225 Difference]: With dead ends: 455 [2019-10-15 01:24:42,547 INFO L226 Difference]: Without dead ends: 291 [2019-10-15 01:24:42,548 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:24:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-10-15 01:24:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-10-15 01:24:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-15 01:24:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 371 transitions. [2019-10-15 01:24:42,561 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 371 transitions. Word has length 161 [2019-10-15 01:24:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:42,561 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 371 transitions. [2019-10-15 01:24:42,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 371 transitions. [2019-10-15 01:24:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-15 01:24:42,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:42,564 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,564 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2129561686, now seen corresponding path program 1 times [2019-10-15 01:24:42,564 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:42,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496233845] [2019-10-15 01:24:42,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-15 01:24:42,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496233845] [2019-10-15 01:24:42,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:42,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:42,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982450604] [2019-10-15 01:24:42,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:42,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:42,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:42,681 INFO L87 Difference]: Start difference. First operand 289 states and 371 transitions. Second operand 4 states. [2019-10-15 01:24:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:42,715 INFO L93 Difference]: Finished difference Result 464 states and 622 transitions. [2019-10-15 01:24:42,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:42,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-15 01:24:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:42,718 INFO L225 Difference]: With dead ends: 464 [2019-10-15 01:24:42,718 INFO L226 Difference]: Without dead ends: 296 [2019-10-15 01:24:42,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-15 01:24:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-10-15 01:24:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-15 01:24:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 375 transitions. [2019-10-15 01:24:42,732 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 375 transitions. Word has length 173 [2019-10-15 01:24:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:42,733 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 375 transitions. [2019-10-15 01:24:42,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 375 transitions. [2019-10-15 01:24:42,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-15 01:24:42,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:42,735 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,736 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1138890084, now seen corresponding path program 1 times [2019-10-15 01:24:42,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:42,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205871190] [2019-10-15 01:24:42,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-15 01:24:42,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205871190] [2019-10-15 01:24:42,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:42,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:42,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159554803] [2019-10-15 01:24:42,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:42,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:42,826 INFO L87 Difference]: Start difference. First operand 294 states and 375 transitions. Second operand 4 states. [2019-10-15 01:24:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:42,861 INFO L93 Difference]: Finished difference Result 466 states and 620 transitions. [2019-10-15 01:24:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:42,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-15 01:24:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:42,865 INFO L225 Difference]: With dead ends: 466 [2019-10-15 01:24:42,866 INFO L226 Difference]: Without dead ends: 293 [2019-10-15 01:24:42,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-15 01:24:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-10-15 01:24:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-15 01:24:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 370 transitions. [2019-10-15 01:24:42,879 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 370 transitions. Word has length 186 [2019-10-15 01:24:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:42,880 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 370 transitions. [2019-10-15 01:24:42,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 370 transitions. [2019-10-15 01:24:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-15 01:24:42,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:42,883 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,883 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:42,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1259328643, now seen corresponding path program 1 times [2019-10-15 01:24:42,884 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:42,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472584579] [2019-10-15 01:24:42,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-15 01:24:42,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472584579] [2019-10-15 01:24:42,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:42,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:42,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027772509] [2019-10-15 01:24:42,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:42,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:42,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:42,985 INFO L87 Difference]: Start difference. First operand 293 states and 370 transitions. Second operand 4 states. [2019-10-15 01:24:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:43,009 INFO L93 Difference]: Finished difference Result 464 states and 610 transitions. [2019-10-15 01:24:43,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:43,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-10-15 01:24:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:43,011 INFO L225 Difference]: With dead ends: 464 [2019-10-15 01:24:43,012 INFO L226 Difference]: Without dead ends: 292 [2019-10-15 01:24:43,013 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:24:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-15 01:24:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-10-15 01:24:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-15 01:24:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 367 transitions. [2019-10-15 01:24:43,025 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 367 transitions. Word has length 199 [2019-10-15 01:24:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:43,026 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 367 transitions. [2019-10-15 01:24:43,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 367 transitions. [2019-10-15 01:24:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-15 01:24:43,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:43,030 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,030 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash 714584693, now seen corresponding path program 1 times [2019-10-15 01:24:43,031 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:43,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296786979] [2019-10-15 01:24:43,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:43,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:43,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-15 01:24:43,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296786979] [2019-10-15 01:24:43,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:43,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:43,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299299631] [2019-10-15 01:24:43,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:43,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:43,136 INFO L87 Difference]: Start difference. First operand 292 states and 367 transitions. Second operand 4 states. [2019-10-15 01:24:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:43,451 INFO L93 Difference]: Finished difference Result 782 states and 1044 transitions. [2019-10-15 01:24:43,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:43,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-10-15 01:24:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:43,460 INFO L225 Difference]: With dead ends: 782 [2019-10-15 01:24:43,461 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:24:43,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:24:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 475. [2019-10-15 01:24:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-10-15 01:24:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 627 transitions. [2019-10-15 01:24:43,487 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 627 transitions. Word has length 201 [2019-10-15 01:24:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:43,488 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 627 transitions. [2019-10-15 01:24:43,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 627 transitions. [2019-10-15 01:24:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-15 01:24:43,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:43,493 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,493 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:43,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash -708936932, now seen corresponding path program 1 times [2019-10-15 01:24:43,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:43,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009275085] [2019-10-15 01:24:43,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:43,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:43,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-15 01:24:43,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009275085] [2019-10-15 01:24:43,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:43,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:43,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661298996] [2019-10-15 01:24:43,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:43,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:43,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:43,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:43,642 INFO L87 Difference]: Start difference. First operand 475 states and 627 transitions. Second operand 4 states. [2019-10-15 01:24:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:43,889 INFO L93 Difference]: Finished difference Result 1172 states and 1612 transitions. [2019-10-15 01:24:43,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:43,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-10-15 01:24:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:43,896 INFO L225 Difference]: With dead ends: 1172 [2019-10-15 01:24:43,896 INFO L226 Difference]: Without dead ends: 818 [2019-10-15 01:24:43,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-15 01:24:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 804. [2019-10-15 01:24:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-10-15 01:24:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1083 transitions. [2019-10-15 01:24:43,946 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1083 transitions. Word has length 236 [2019-10-15 01:24:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:43,947 INFO L462 AbstractCegarLoop]: Abstraction has 804 states and 1083 transitions. [2019-10-15 01:24:43,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1083 transitions. [2019-10-15 01:24:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-15 01:24:43,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:43,954 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,954 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:43,954 INFO L82 PathProgramCache]: Analyzing trace with hash 847110771, now seen corresponding path program 1 times [2019-10-15 01:24:43,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:43,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257028905] [2019-10-15 01:24:43,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:43,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:43,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-15 01:24:44,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257028905] [2019-10-15 01:24:44,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:44,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:44,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481245680] [2019-10-15 01:24:44,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:44,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:44,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:44,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:44,063 INFO L87 Difference]: Start difference. First operand 804 states and 1083 transitions. Second operand 4 states. [2019-10-15 01:24:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:44,311 INFO L93 Difference]: Finished difference Result 2150 states and 2975 transitions. [2019-10-15 01:24:44,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:44,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-15 01:24:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:44,323 INFO L225 Difference]: With dead ends: 2150 [2019-10-15 01:24:44,323 INFO L226 Difference]: Without dead ends: 1473 [2019-10-15 01:24:44,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-10-15 01:24:44,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1111. [2019-10-15 01:24:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-15 01:24:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1511 transitions. [2019-10-15 01:24:44,405 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1511 transitions. Word has length 237 [2019-10-15 01:24:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:44,407 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 1511 transitions. [2019-10-15 01:24:44,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1511 transitions. [2019-10-15 01:24:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-15 01:24:44,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:44,412 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,413 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1622525289, now seen corresponding path program 1 times [2019-10-15 01:24:44,413 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:44,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550519417] [2019-10-15 01:24:44,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:44,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:44,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-15 01:24:44,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550519417] [2019-10-15 01:24:44,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:44,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:44,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993359159] [2019-10-15 01:24:44,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:44,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:44,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:44,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:44,563 INFO L87 Difference]: Start difference. First operand 1111 states and 1511 transitions. Second operand 4 states. [2019-10-15 01:24:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:45,009 INFO L93 Difference]: Finished difference Result 3098 states and 4298 transitions. [2019-10-15 01:24:45,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:45,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-10-15 01:24:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:45,025 INFO L225 Difference]: With dead ends: 3098 [2019-10-15 01:24:45,025 INFO L226 Difference]: Without dead ends: 2114 [2019-10-15 01:24:45,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-10-15 01:24:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1401. [2019-10-15 01:24:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-15 01:24:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1917 transitions. [2019-10-15 01:24:45,138 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1917 transitions. Word has length 238 [2019-10-15 01:24:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:45,139 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 1917 transitions. [2019-10-15 01:24:45,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1917 transitions. [2019-10-15 01:24:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-15 01:24:45,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:45,146 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,146 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:45,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:45,146 INFO L82 PathProgramCache]: Analyzing trace with hash 428458709, now seen corresponding path program 1 times [2019-10-15 01:24:45,146 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:45,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085104610] [2019-10-15 01:24:45,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:45,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:45,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-10-15 01:24:45,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085104610] [2019-10-15 01:24:45,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386894231] [2019-10-15 01:24:45,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:45,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:24:45,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:24:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-15 01:24:45,614 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:24:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-10-15 01:24:45,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [932305015] [2019-10-15 01:24:45,803 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 239 [2019-10-15 01:24:45,816 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:24:45,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:24:45,841 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:24:46,030 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:24:46,031 INFO L272 AbstractInterpreter]: Visited 123 different actions 327 times. Merged at 21 different actions 64 times. Never widened. Performed 1569 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1569 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 4 fixpoints after 1 different actions. Largest state had 90 variables. [2019-10-15 01:24:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:46,031 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:24:46,255 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 84.4% of their original sizes. [2019-10-15 01:24:46,255 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:24:49,369 INFO L553 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2019-10-15 01:24:49,369 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:24:49,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:24:49,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [7, 5, 5] total 83 [2019-10-15 01:24:49,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116155822] [2019-10-15 01:24:49,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-15 01:24:49,371 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:49,371 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:24:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-15 01:24:49,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=5162, Unknown=0, NotChecked=0, Total=5550 [2019-10-15 01:24:49,373 INFO L87 Difference]: Start difference. First operand 1401 states and 1917 transitions. Second operand 75 states.