java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:03:46,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:03:46,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:03:46,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:03:46,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:03:46,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:03:46,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:03:46,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:03:46,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:03:46,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:03:46,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:03:46,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:03:46,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:03:46,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:03:46,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:03:46,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:03:46,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:03:46,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:03:46,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:03:46,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:03:46,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:03:46,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:03:46,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:03:46,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:03:46,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:03:46,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:03:46,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:03:46,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:03:46,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:03:46,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:03:46,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:03:46,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:03:46,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:03:46,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:03:46,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:03:46,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:03:46,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:03:46,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:03:46,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:03:46,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:03:46,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:03:46,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:03:46,921 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:03:46,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:03:46,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:03:46,922 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:03:46,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:03:46,923 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:03:46,923 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:03:46,923 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:03:46,924 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:03:46,924 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:03:46,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:03:46,926 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:03:46,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:03:46,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:03:46,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:03:46,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:03:46,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:03:46,927 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:03:46,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:03:46,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:03:46,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:03:46,928 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:03:46,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:03:46,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:03:46,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:03:46,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:03:46,930 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:03:46,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:03:46,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:03:46,930 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:03:46,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:03:47,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:03:47,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:03:47,007 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:03:47,008 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:03:47,008 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:03:47,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c4dbef1/2c91e1cb075343e1b006b11f348849f6/FLAG25104a57c [2019-09-10 07:03:47,563 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:03:47,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:03:47,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c4dbef1/2c91e1cb075343e1b006b11f348849f6/FLAG25104a57c [2019-09-10 07:03:47,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c4dbef1/2c91e1cb075343e1b006b11f348849f6 [2019-09-10 07:03:47,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:03:47,945 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:03:47,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:03:47,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:03:47,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:03:47,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:03:47" (1/1) ... [2019-09-10 07:03:47,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d681588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:47, skipping insertion in model container [2019-09-10 07:03:47,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:03:47" (1/1) ... [2019-09-10 07:03:47,961 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:03:48,009 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:03:48,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:03:48,461 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:03:48,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:03:48,581 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:03:48,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48 WrapperNode [2019-09-10 07:03:48,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:03:48,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:03:48,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:03:48,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:03:48,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48" (1/1) ... [2019-09-10 07:03:48,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48" (1/1) ... [2019-09-10 07:03:48,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48" (1/1) ... [2019-09-10 07:03:48,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48" (1/1) ... [2019-09-10 07:03:48,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48" (1/1) ... [2019-09-10 07:03:48,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48" (1/1) ... [2019-09-10 07:03:48,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48" (1/1) ... [2019-09-10 07:03:48,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:03:48,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:03:48,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:03:48,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:03:48,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:03:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:03:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:03:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:03:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:03:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:03:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:03:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:03:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:03:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:03:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:03:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:03:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:03:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:03:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:03:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:03:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:03:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:03:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:03:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:03:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:03:49,645 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:03:49,646 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:03:49,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:03:49 BoogieIcfgContainer [2019-09-10 07:03:49,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:03:49,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:03:49,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:03:49,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:03:49,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:03:47" (1/3) ... [2019-09-10 07:03:49,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e23752a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:03:49, skipping insertion in model container [2019-09-10 07:03:49,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:03:48" (2/3) ... [2019-09-10 07:03:49,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e23752a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:03:49, skipping insertion in model container [2019-09-10 07:03:49,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:03:49" (3/3) ... [2019-09-10 07:03:49,662 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:03:49,674 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:03:49,698 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:03:49,718 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:03:49,755 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:03:49,755 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:03:49,756 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:03:49,756 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:03:49,756 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:03:49,757 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:03:49,757 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:03:49,757 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:03:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2019-09-10 07:03:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:03:49,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:49,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:49,803 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:49,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1726351890, now seen corresponding path program 1 times [2019-09-10 07:03:49,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:49,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:49,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:50,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:50,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:03:50,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:50,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:03:50,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:03:50,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:03:50,383 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 7 states. [2019-09-10 07:03:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:50,863 INFO L93 Difference]: Finished difference Result 1044 states and 1655 transitions. [2019-09-10 07:03:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:03:50,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-10 07:03:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:50,901 INFO L225 Difference]: With dead ends: 1044 [2019-09-10 07:03:50,901 INFO L226 Difference]: Without dead ends: 1024 [2019-09-10 07:03:50,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:03:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2019-09-10 07:03:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 514. [2019-09-10 07:03:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-10 07:03:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 794 transitions. [2019-09-10 07:03:51,040 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 794 transitions. Word has length 68 [2019-09-10 07:03:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:51,042 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 794 transitions. [2019-09-10 07:03:51,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:03:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 794 transitions. [2019-09-10 07:03:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:03:51,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:51,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:51,050 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:51,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2038700647, now seen corresponding path program 1 times [2019-09-10 07:03:51,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:51,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:51,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:51,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:51,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:51,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:51,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:03:51,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:51,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:03:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:03:51,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:51,379 INFO L87 Difference]: Start difference. First operand 514 states and 794 transitions. Second operand 6 states. [2019-09-10 07:03:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:51,645 INFO L93 Difference]: Finished difference Result 1391 states and 2151 transitions. [2019-09-10 07:03:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:03:51,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 07:03:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:51,656 INFO L225 Difference]: With dead ends: 1391 [2019-09-10 07:03:51,656 INFO L226 Difference]: Without dead ends: 1391 [2019-09-10 07:03:51,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-09-10 07:03:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1385. [2019-09-10 07:03:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-09-10 07:03:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2148 transitions. [2019-09-10 07:03:51,698 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2148 transitions. Word has length 69 [2019-09-10 07:03:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:51,698 INFO L475 AbstractCegarLoop]: Abstraction has 1385 states and 2148 transitions. [2019-09-10 07:03:51,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:03:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2148 transitions. [2019-09-10 07:03:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:03:51,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:51,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:51,707 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:51,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:51,709 INFO L82 PathProgramCache]: Analyzing trace with hash 618782839, now seen corresponding path program 1 times [2019-09-10 07:03:51,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:51,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:51,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:51,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:51,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:03:51,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:51,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:03:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:03:51,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:03:51,852 INFO L87 Difference]: Start difference. First operand 1385 states and 2148 transitions. Second operand 5 states. [2019-09-10 07:03:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:52,157 INFO L93 Difference]: Finished difference Result 2356 states and 3650 transitions. [2019-09-10 07:03:52,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:03:52,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 07:03:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:52,172 INFO L225 Difference]: With dead ends: 2356 [2019-09-10 07:03:52,172 INFO L226 Difference]: Without dead ends: 2356 [2019-09-10 07:03:52,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:03:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2019-09-10 07:03:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2354. [2019-09-10 07:03:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2354 states. [2019-09-10 07:03:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 3649 transitions. [2019-09-10 07:03:52,239 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 3649 transitions. Word has length 70 [2019-09-10 07:03:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:52,239 INFO L475 AbstractCegarLoop]: Abstraction has 2354 states and 3649 transitions. [2019-09-10 07:03:52,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:03:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 3649 transitions. [2019-09-10 07:03:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:03:52,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:52,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:52,242 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:52,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1384706248, now seen corresponding path program 1 times [2019-09-10 07:03:52,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:52,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:52,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:52,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:52,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:52,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:03:52,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:52,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:03:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:03:52,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:52,395 INFO L87 Difference]: Start difference. First operand 2354 states and 3649 transitions. Second operand 6 states. [2019-09-10 07:03:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:52,788 INFO L93 Difference]: Finished difference Result 6393 states and 9895 transitions. [2019-09-10 07:03:52,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:03:52,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:03:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:52,821 INFO L225 Difference]: With dead ends: 6393 [2019-09-10 07:03:52,821 INFO L226 Difference]: Without dead ends: 6393 [2019-09-10 07:03:52,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:03:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6393 states. [2019-09-10 07:03:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6393 to 6389. [2019-09-10 07:03:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6389 states. [2019-09-10 07:03:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6389 states to 6389 states and 9893 transitions. [2019-09-10 07:03:52,977 INFO L78 Accepts]: Start accepts. Automaton has 6389 states and 9893 transitions. Word has length 70 [2019-09-10 07:03:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:52,978 INFO L475 AbstractCegarLoop]: Abstraction has 6389 states and 9893 transitions. [2019-09-10 07:03:52,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:03:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6389 states and 9893 transitions. [2019-09-10 07:03:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:03:52,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:52,981 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:52,981 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash -554775271, now seen corresponding path program 1 times [2019-09-10 07:03:52,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:52,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:52,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:52,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:52,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:53,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:53,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:03:53,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:53,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:03:53,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:03:53,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:53,094 INFO L87 Difference]: Start difference. First operand 6389 states and 9893 transitions. Second operand 6 states. [2019-09-10 07:03:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:53,535 INFO L93 Difference]: Finished difference Result 17828 states and 27480 transitions. [2019-09-10 07:03:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:03:53,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:03:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:53,622 INFO L225 Difference]: With dead ends: 17828 [2019-09-10 07:03:53,622 INFO L226 Difference]: Without dead ends: 17828 [2019-09-10 07:03:53,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:03:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17828 states. [2019-09-10 07:03:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17828 to 17824. [2019-09-10 07:03:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17824 states. [2019-09-10 07:03:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17824 states to 17824 states and 27478 transitions. [2019-09-10 07:03:54,059 INFO L78 Accepts]: Start accepts. Automaton has 17824 states and 27478 transitions. Word has length 70 [2019-09-10 07:03:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:54,060 INFO L475 AbstractCegarLoop]: Abstraction has 17824 states and 27478 transitions. [2019-09-10 07:03:54,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:03:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 17824 states and 27478 transitions. [2019-09-10 07:03:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:03:54,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:54,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:54,065 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:54,066 INFO L82 PathProgramCache]: Analyzing trace with hash -744278678, now seen corresponding path program 1 times [2019-09-10 07:03:54,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:54,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:54,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:54,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:54,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:54,316 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-10 07:03:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:54,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:54,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:03:54,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:54,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:03:54,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:03:54,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:54,340 INFO L87 Difference]: Start difference. First operand 17824 states and 27478 transitions. Second operand 6 states. [2019-09-10 07:03:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:54,811 INFO L93 Difference]: Finished difference Result 50796 states and 78036 transitions. [2019-09-10 07:03:54,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:03:54,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:03:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:54,978 INFO L225 Difference]: With dead ends: 50796 [2019-09-10 07:03:54,978 INFO L226 Difference]: Without dead ends: 50796 [2019-09-10 07:03:54,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:03:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50796 states. [2019-09-10 07:03:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50796 to 44498. [2019-09-10 07:03:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44498 states. [2019-09-10 07:03:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44498 states to 44498 states and 68344 transitions. [2019-09-10 07:03:55,899 INFO L78 Accepts]: Start accepts. Automaton has 44498 states and 68344 transitions. Word has length 70 [2019-09-10 07:03:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:55,900 INFO L475 AbstractCegarLoop]: Abstraction has 44498 states and 68344 transitions. [2019-09-10 07:03:55,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:03:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44498 states and 68344 transitions. [2019-09-10 07:03:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:03:55,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:55,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:55,910 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash 106374034, now seen corresponding path program 1 times [2019-09-10 07:03:55,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:55,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:55,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:55,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:55,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:56,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:56,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:03:56,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:56,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:03:56,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:03:56,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:03:56,910 INFO L87 Difference]: Start difference. First operand 44498 states and 68344 transitions. Second operand 5 states. [2019-09-10 07:03:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:57,121 INFO L93 Difference]: Finished difference Result 73541 states and 111787 transitions. [2019-09-10 07:03:57,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:03:57,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:03:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:57,343 INFO L225 Difference]: With dead ends: 73541 [2019-09-10 07:03:57,344 INFO L226 Difference]: Without dead ends: 73541 [2019-09-10 07:03:57,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73541 states. [2019-09-10 07:03:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73541 to 45182. [2019-09-10 07:03:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45182 states. [2019-09-10 07:03:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45182 states to 45182 states and 68821 transitions. [2019-09-10 07:03:58,491 INFO L78 Accepts]: Start accepts. Automaton has 45182 states and 68821 transitions. Word has length 71 [2019-09-10 07:03:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:58,492 INFO L475 AbstractCegarLoop]: Abstraction has 45182 states and 68821 transitions. [2019-09-10 07:03:58,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:03:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 45182 states and 68821 transitions. [2019-09-10 07:03:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:03:58,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:58,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:58,498 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:58,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:58,499 INFO L82 PathProgramCache]: Analyzing trace with hash -718918452, now seen corresponding path program 1 times [2019-09-10 07:03:58,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:58,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:58,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:58,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:03:58,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:58,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:03:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:03:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:03:58,739 INFO L87 Difference]: Start difference. First operand 45182 states and 68821 transitions. Second operand 10 states. [2019-09-10 07:04:01,617 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-09-10 07:04:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:02,021 INFO L93 Difference]: Finished difference Result 293718 states and 441486 transitions. [2019-09-10 07:04:02,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:04:02,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 07:04:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:02,559 INFO L225 Difference]: With dead ends: 293718 [2019-09-10 07:04:02,560 INFO L226 Difference]: Without dead ends: 293718 [2019-09-10 07:04:02,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:04:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293718 states. [2019-09-10 07:04:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293718 to 45237. [2019-09-10 07:04:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45237 states. [2019-09-10 07:04:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45237 states to 45237 states and 68880 transitions. [2019-09-10 07:04:06,773 INFO L78 Accepts]: Start accepts. Automaton has 45237 states and 68880 transitions. Word has length 72 [2019-09-10 07:04:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:06,773 INFO L475 AbstractCegarLoop]: Abstraction has 45237 states and 68880 transitions. [2019-09-10 07:04:06,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:04:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 45237 states and 68880 transitions. [2019-09-10 07:04:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:04:06,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:06,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:06,777 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1903245012, now seen corresponding path program 1 times [2019-09-10 07:04:06,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:06,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:06,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:06,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:06,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:06,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:06,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:04:06,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:06,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:04:06,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:04:06,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:04:06,977 INFO L87 Difference]: Start difference. First operand 45237 states and 68880 transitions. Second operand 10 states. [2019-09-10 07:04:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:11,006 INFO L93 Difference]: Finished difference Result 359865 states and 548279 transitions. [2019-09-10 07:04:11,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:04:11,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 07:04:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:11,556 INFO L225 Difference]: With dead ends: 359865 [2019-09-10 07:04:11,556 INFO L226 Difference]: Without dead ends: 359865 [2019-09-10 07:04:11,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:04:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359865 states. [2019-09-10 07:04:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359865 to 45448. [2019-09-10 07:04:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45448 states. [2019-09-10 07:04:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45448 states to 45448 states and 69142 transitions. [2019-09-10 07:04:16,149 INFO L78 Accepts]: Start accepts. Automaton has 45448 states and 69142 transitions. Word has length 72 [2019-09-10 07:04:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:16,150 INFO L475 AbstractCegarLoop]: Abstraction has 45448 states and 69142 transitions. [2019-09-10 07:04:16,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:04:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 45448 states and 69142 transitions. [2019-09-10 07:04:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:04:16,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:16,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:16,155 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:16,156 INFO L82 PathProgramCache]: Analyzing trace with hash 946021772, now seen corresponding path program 1 times [2019-09-10 07:04:16,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:16,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:16,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:16,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:16,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:16,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:04:16,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:16,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:04:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:04:16,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:04:16,634 INFO L87 Difference]: Start difference. First operand 45448 states and 69142 transitions. Second operand 10 states. [2019-09-10 07:04:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:20,483 INFO L93 Difference]: Finished difference Result 304543 states and 463260 transitions. [2019-09-10 07:04:20,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:04:20,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 07:04:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:21,480 INFO L225 Difference]: With dead ends: 304543 [2019-09-10 07:04:21,480 INFO L226 Difference]: Without dead ends: 304543 [2019-09-10 07:04:21,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:04:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304543 states. [2019-09-10 07:04:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304543 to 45841. [2019-09-10 07:04:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45841 states. [2019-09-10 07:04:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45841 states to 45841 states and 69639 transitions. [2019-09-10 07:04:22,945 INFO L78 Accepts]: Start accepts. Automaton has 45841 states and 69639 transitions. Word has length 72 [2019-09-10 07:04:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:22,945 INFO L475 AbstractCegarLoop]: Abstraction has 45841 states and 69639 transitions. [2019-09-10 07:04:22,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:04:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 45841 states and 69639 transitions. [2019-09-10 07:04:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:04:22,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:22,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:22,953 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1011565036, now seen corresponding path program 1 times [2019-09-10 07:04:22,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:22,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:22,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:23,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:23,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:04:23,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:23,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:04:23,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:04:23,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:04:23,313 INFO L87 Difference]: Start difference. First operand 45841 states and 69639 transitions. Second operand 10 states. [2019-09-10 07:04:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:26,120 INFO L93 Difference]: Finished difference Result 271768 states and 412788 transitions. [2019-09-10 07:04:26,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:04:26,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 07:04:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:26,513 INFO L225 Difference]: With dead ends: 271768 [2019-09-10 07:04:26,513 INFO L226 Difference]: Without dead ends: 271768 [2019-09-10 07:04:26,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:04:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271768 states. [2019-09-10 07:04:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271768 to 45841. [2019-09-10 07:04:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45841 states. [2019-09-10 07:04:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45841 states to 45841 states and 69631 transitions. [2019-09-10 07:04:29,852 INFO L78 Accepts]: Start accepts. Automaton has 45841 states and 69631 transitions. Word has length 72 [2019-09-10 07:04:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:29,852 INFO L475 AbstractCegarLoop]: Abstraction has 45841 states and 69631 transitions. [2019-09-10 07:04:29,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:04:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45841 states and 69631 transitions. [2019-09-10 07:04:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:04:29,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:29,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:29,858 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:29,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:29,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1901872630, now seen corresponding path program 1 times [2019-09-10 07:04:29,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:29,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:29,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:29,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:29,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:29,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:04:29,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:29,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:04:29,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:04:29,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:04:29,905 INFO L87 Difference]: Start difference. First operand 45841 states and 69631 transitions. Second operand 3 states. [2019-09-10 07:04:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:30,070 INFO L93 Difference]: Finished difference Result 67434 states and 101102 transitions. [2019-09-10 07:04:30,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:04:30,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:04:30,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:30,150 INFO L225 Difference]: With dead ends: 67434 [2019-09-10 07:04:30,150 INFO L226 Difference]: Without dead ends: 67434 [2019-09-10 07:04:30,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:04:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67434 states. [2019-09-10 07:04:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67434 to 66664. [2019-09-10 07:04:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66664 states. [2019-09-10 07:04:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66664 states to 66664 states and 100333 transitions. [2019-09-10 07:04:31,044 INFO L78 Accepts]: Start accepts. Automaton has 66664 states and 100333 transitions. Word has length 73 [2019-09-10 07:04:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:31,044 INFO L475 AbstractCegarLoop]: Abstraction has 66664 states and 100333 transitions. [2019-09-10 07:04:31,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:04:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 66664 states and 100333 transitions. [2019-09-10 07:04:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:04:31,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:31,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:31,050 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash -244859483, now seen corresponding path program 1 times [2019-09-10 07:04:31,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:31,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:31,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:31,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:31,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:04:31,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:31,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:04:31,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:04:31,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:04:31,143 INFO L87 Difference]: Start difference. First operand 66664 states and 100333 transitions. Second operand 4 states. [2019-09-10 07:04:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:31,456 INFO L93 Difference]: Finished difference Result 107086 states and 158935 transitions. [2019-09-10 07:04:31,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:04:31,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-10 07:04:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:31,622 INFO L225 Difference]: With dead ends: 107086 [2019-09-10 07:04:31,622 INFO L226 Difference]: Without dead ends: 107086 [2019-09-10 07:04:31,623 INFO L628 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-09-10 07:04:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107086 states. [2019-09-10 07:04:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107086 to 106304. [2019-09-10 07:04:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106304 states. [2019-09-10 07:04:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106304 states to 106304 states and 158154 transitions. [2019-09-10 07:04:35,409 INFO L78 Accepts]: Start accepts. Automaton has 106304 states and 158154 transitions. Word has length 73 [2019-09-10 07:04:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:35,410 INFO L475 AbstractCegarLoop]: Abstraction has 106304 states and 158154 transitions. [2019-09-10 07:04:35,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:04:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 106304 states and 158154 transitions. [2019-09-10 07:04:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:04:35,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:35,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:35,414 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:35,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:35,414 INFO L82 PathProgramCache]: Analyzing trace with hash 909512172, now seen corresponding path program 1 times [2019-09-10 07:04:35,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:35,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:35,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:35,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:35,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:35,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:35,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:04:35,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:35,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:04:35,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:04:35,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:04:35,463 INFO L87 Difference]: Start difference. First operand 106304 states and 158154 transitions. Second operand 3 states. [2019-09-10 07:04:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:35,880 INFO L93 Difference]: Finished difference Result 130605 states and 190182 transitions. [2019-09-10 07:04:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:04:35,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:04:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:36,110 INFO L225 Difference]: With dead ends: 130605 [2019-09-10 07:04:36,110 INFO L226 Difference]: Without dead ends: 130605 [2019-09-10 07:04:36,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:04:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130605 states. [2019-09-10 07:04:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130605 to 128983. [2019-09-10 07:04:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128983 states. [2019-09-10 07:04:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128983 states to 128983 states and 188561 transitions. [2019-09-10 07:04:37,339 INFO L78 Accepts]: Start accepts. Automaton has 128983 states and 188561 transitions. Word has length 73 [2019-09-10 07:04:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:37,339 INFO L475 AbstractCegarLoop]: Abstraction has 128983 states and 188561 transitions. [2019-09-10 07:04:37,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:04:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 128983 states and 188561 transitions. [2019-09-10 07:04:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:04:37,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:37,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:37,342 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:37,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:37,343 INFO L82 PathProgramCache]: Analyzing trace with hash 907139436, now seen corresponding path program 1 times [2019-09-10 07:04:37,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:37,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:37,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:37,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:37,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:04:37,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:37,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:04:37,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:04:37,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:04:37,744 INFO L87 Difference]: Start difference. First operand 128983 states and 188561 transitions. Second operand 3 states. [2019-09-10 07:04:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:38,238 INFO L93 Difference]: Finished difference Result 164952 states and 236519 transitions. [2019-09-10 07:04:38,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:04:38,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:04:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:38,526 INFO L225 Difference]: With dead ends: 164952 [2019-09-10 07:04:38,526 INFO L226 Difference]: Without dead ends: 164952 [2019-09-10 07:04:38,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:04:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164952 states. [2019-09-10 07:04:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164952 to 164292. [2019-09-10 07:04:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164292 states. [2019-09-10 07:04:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164292 states to 164292 states and 235860 transitions. [2019-09-10 07:04:40,983 INFO L78 Accepts]: Start accepts. Automaton has 164292 states and 235860 transitions. Word has length 73 [2019-09-10 07:04:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:40,983 INFO L475 AbstractCegarLoop]: Abstraction has 164292 states and 235860 transitions. [2019-09-10 07:04:40,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:04:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 164292 states and 235860 transitions. [2019-09-10 07:04:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:04:40,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:40,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:40,987 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:40,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:40,987 INFO L82 PathProgramCache]: Analyzing trace with hash -865418125, now seen corresponding path program 1 times [2019-09-10 07:04:40,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:40,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:40,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:40,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:40,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:41,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:41,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:04:41,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:41,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:04:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:04:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:04:41,082 INFO L87 Difference]: Start difference. First operand 164292 states and 235860 transitions. Second operand 7 states. [2019-09-10 07:04:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:42,945 INFO L93 Difference]: Finished difference Result 592992 states and 842636 transitions. [2019-09-10 07:04:42,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:04:42,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 07:04:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:44,043 INFO L225 Difference]: With dead ends: 592992 [2019-09-10 07:04:44,043 INFO L226 Difference]: Without dead ends: 592992 [2019-09-10 07:04:44,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:04:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592992 states. [2019-09-10 07:04:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592992 to 164332. [2019-09-10 07:04:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164332 states. [2019-09-10 07:04:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164332 states to 164332 states and 235908 transitions. [2019-09-10 07:04:53,438 INFO L78 Accepts]: Start accepts. Automaton has 164332 states and 235908 transitions. Word has length 74 [2019-09-10 07:04:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:53,439 INFO L475 AbstractCegarLoop]: Abstraction has 164332 states and 235908 transitions. [2019-09-10 07:04:53,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:04:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 164332 states and 235908 transitions. [2019-09-10 07:04:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:04:53,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:53,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:53,442 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1280232077, now seen corresponding path program 1 times [2019-09-10 07:04:53,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:53,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:53,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:53,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:53,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:04:53,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:53,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:04:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:04:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:04:53,512 INFO L87 Difference]: Start difference. First operand 164332 states and 235908 transitions. Second operand 7 states. [2019-09-10 07:04:54,221 WARN L188 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-09-10 07:04:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:56,801 INFO L93 Difference]: Finished difference Result 712528 states and 1020539 transitions. [2019-09-10 07:04:56,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:04:56,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 07:04:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:58,251 INFO L225 Difference]: With dead ends: 712528 [2019-09-10 07:04:58,252 INFO L226 Difference]: Without dead ends: 712528 [2019-09-10 07:04:58,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:04:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712528 states. [2019-09-10 07:05:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712528 to 164436. [2019-09-10 07:05:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164436 states. [2019-09-10 07:05:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164436 states to 164436 states and 236033 transitions. [2019-09-10 07:05:11,564 INFO L78 Accepts]: Start accepts. Automaton has 164436 states and 236033 transitions. Word has length 74 [2019-09-10 07:05:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:11,565 INFO L475 AbstractCegarLoop]: Abstraction has 164436 states and 236033 transitions. [2019-09-10 07:05:11,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:05:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 164436 states and 236033 transitions. [2019-09-10 07:05:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:05:11,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:11,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:11,569 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:11,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:11,569 INFO L82 PathProgramCache]: Analyzing trace with hash 109033983, now seen corresponding path program 1 times [2019-09-10 07:05:11,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:11,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:11,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:11,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:11,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:11,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:11,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:05:11,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:11,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:05:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:05:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:05:11,654 INFO L87 Difference]: Start difference. First operand 164436 states and 236033 transitions. Second operand 7 states. [2019-09-10 07:05:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:13,885 INFO L93 Difference]: Finished difference Result 588365 states and 836732 transitions. [2019-09-10 07:05:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:05:13,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 07:05:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:16,295 INFO L225 Difference]: With dead ends: 588365 [2019-09-10 07:05:16,295 INFO L226 Difference]: Without dead ends: 588365 [2019-09-10 07:05:16,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:05:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588365 states. [2019-09-10 07:05:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588365 to 164608. [2019-09-10 07:05:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164608 states. [2019-09-10 07:05:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164608 states to 164608 states and 236244 transitions. [2019-09-10 07:05:25,181 INFO L78 Accepts]: Start accepts. Automaton has 164608 states and 236244 transitions. Word has length 74 [2019-09-10 07:05:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:25,182 INFO L475 AbstractCegarLoop]: Abstraction has 164608 states and 236244 transitions. [2019-09-10 07:05:25,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:05:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 164608 states and 236244 transitions. [2019-09-10 07:05:25,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:05:25,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:25,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:25,186 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:25,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:25,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1884931138, now seen corresponding path program 1 times [2019-09-10 07:05:25,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:25,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:25,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:25,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:25,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:25,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:25,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:05:25,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:25,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:05:25,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:05:25,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:05:25,272 INFO L87 Difference]: Start difference. First operand 164608 states and 236244 transitions. Second operand 6 states. [2019-09-10 07:05:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:26,381 INFO L93 Difference]: Finished difference Result 323293 states and 464182 transitions. [2019-09-10 07:05:26,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:05:26,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 07:05:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:26,831 INFO L225 Difference]: With dead ends: 323293 [2019-09-10 07:05:26,832 INFO L226 Difference]: Without dead ends: 323293 [2019-09-10 07:05:26,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:05:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323293 states. [2019-09-10 07:05:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323293 to 188956. [2019-09-10 07:05:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188956 states. [2019-09-10 07:05:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188956 states to 188956 states and 271660 transitions. [2019-09-10 07:05:34,082 INFO L78 Accepts]: Start accepts. Automaton has 188956 states and 271660 transitions. Word has length 76 [2019-09-10 07:05:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:34,082 INFO L475 AbstractCegarLoop]: Abstraction has 188956 states and 271660 transitions. [2019-09-10 07:05:34,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:05:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 188956 states and 271660 transitions. [2019-09-10 07:05:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:05:34,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:34,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:34,087 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash 581569352, now seen corresponding path program 1 times [2019-09-10 07:05:34,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:34,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:34,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:34,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:34,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:34,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:34,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:05:34,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:34,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:05:34,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:05:34,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:05:34,186 INFO L87 Difference]: Start difference. First operand 188956 states and 271660 transitions. Second operand 6 states. [2019-09-10 07:05:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:35,544 INFO L93 Difference]: Finished difference Result 337266 states and 484925 transitions. [2019-09-10 07:05:35,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:05:35,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 07:05:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:36,108 INFO L225 Difference]: With dead ends: 337266 [2019-09-10 07:05:36,108 INFO L226 Difference]: Without dead ends: 337266 [2019-09-10 07:05:36,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:05:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337266 states. [2019-09-10 07:05:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337266 to 203787. [2019-09-10 07:05:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203787 states. [2019-09-10 07:05:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203787 states to 203787 states and 293144 transitions. [2019-09-10 07:05:43,629 INFO L78 Accepts]: Start accepts. Automaton has 203787 states and 293144 transitions. Word has length 76 [2019-09-10 07:05:43,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:43,629 INFO L475 AbstractCegarLoop]: Abstraction has 203787 states and 293144 transitions. [2019-09-10 07:05:43,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:05:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 203787 states and 293144 transitions. [2019-09-10 07:05:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:05:43,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:43,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:43,636 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1953619948, now seen corresponding path program 1 times [2019-09-10 07:05:43,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:43,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:43,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:43,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:43,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:43,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:05:43,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:43,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:05:43,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:05:43,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:05:43,713 INFO L87 Difference]: Start difference. First operand 203787 states and 293144 transitions. Second operand 6 states. [2019-09-10 07:05:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:45,263 INFO L93 Difference]: Finished difference Result 348654 states and 501063 transitions. [2019-09-10 07:05:45,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:05:45,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 07:05:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:45,780 INFO L225 Difference]: With dead ends: 348654 [2019-09-10 07:05:45,780 INFO L226 Difference]: Without dead ends: 348654 [2019-09-10 07:05:45,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:05:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348654 states. [2019-09-10 07:05:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348654 to 228663. [2019-09-10 07:05:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228663 states. [2019-09-10 07:05:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228663 states to 228663 states and 329331 transitions. [2019-09-10 07:05:53,367 INFO L78 Accepts]: Start accepts. Automaton has 228663 states and 329331 transitions. Word has length 76 [2019-09-10 07:05:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:53,367 INFO L475 AbstractCegarLoop]: Abstraction has 228663 states and 329331 transitions. [2019-09-10 07:05:53,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:05:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 228663 states and 329331 transitions. [2019-09-10 07:05:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:05:53,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:53,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:53,374 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:53,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1552110678, now seen corresponding path program 1 times [2019-09-10 07:05:53,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:53,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:53,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:53,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:53,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:53,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:53,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:53,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:53,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:53,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:53,420 INFO L87 Difference]: Start difference. First operand 228663 states and 329331 transitions. Second operand 3 states. [2019-09-10 07:05:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:54,240 INFO L93 Difference]: Finished difference Result 264945 states and 373991 transitions. [2019-09-10 07:05:54,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:54,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 07:05:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:54,897 INFO L225 Difference]: With dead ends: 264945 [2019-09-10 07:05:54,897 INFO L226 Difference]: Without dead ends: 263217 [2019-09-10 07:05:54,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263217 states. [2019-09-10 07:05:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263217 to 232157. [2019-09-10 07:05:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232157 states. [2019-09-10 07:05:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232157 states to 232157 states and 329633 transitions. [2019-09-10 07:05:59,831 INFO L78 Accepts]: Start accepts. Automaton has 232157 states and 329633 transitions. Word has length 78 [2019-09-10 07:05:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:59,831 INFO L475 AbstractCegarLoop]: Abstraction has 232157 states and 329633 transitions. [2019-09-10 07:05:59,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 232157 states and 329633 transitions. [2019-09-10 07:05:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:05:59,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:59,836 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:59,837 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2042603589, now seen corresponding path program 1 times [2019-09-10 07:05:59,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:59,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:59,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:59,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:59,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:59,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:59,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:05:59,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:59,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:05:59,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:05:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:05:59,941 INFO L87 Difference]: Start difference. First operand 232157 states and 329633 transitions. Second operand 7 states. [2019-09-10 07:06:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:07,299 INFO L93 Difference]: Finished difference Result 698162 states and 973293 transitions. [2019-09-10 07:06:07,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:06:07,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-10 07:06:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:08,258 INFO L225 Difference]: With dead ends: 698162 [2019-09-10 07:06:08,259 INFO L226 Difference]: Without dead ends: 698162 [2019-09-10 07:06:08,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:06:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698162 states. [2019-09-10 07:06:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698162 to 232436. [2019-09-10 07:06:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232436 states. [2019-09-10 07:06:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232436 states to 232436 states and 329956 transitions. [2019-09-10 07:06:13,999 INFO L78 Accepts]: Start accepts. Automaton has 232436 states and 329956 transitions. Word has length 79 [2019-09-10 07:06:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:13,999 INFO L475 AbstractCegarLoop]: Abstraction has 232436 states and 329956 transitions. [2019-09-10 07:06:14,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 232436 states and 329956 transitions. [2019-09-10 07:06:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:06:14,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:14,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:14,006 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash 14162140, now seen corresponding path program 1 times [2019-09-10 07:06:14,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:14,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:14,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:14,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:14,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:06:14,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:14,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:06:14,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:06:14,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:06:14,612 INFO L87 Difference]: Start difference. First operand 232436 states and 329956 transitions. Second operand 13 states. [2019-09-10 07:06:15,068 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 07:06:15,239 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:06:15,444 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:06:15,706 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:06:16,006 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 07:06:16,912 WARN L188 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:06:17,165 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 07:06:17,497 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:06:18,060 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 07:06:18,836 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 07:06:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:23,377 INFO L93 Difference]: Finished difference Result 1296591 states and 1830600 transitions. [2019-09-10 07:06:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:06:23,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2019-09-10 07:06:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:34,873 INFO L225 Difference]: With dead ends: 1296591 [2019-09-10 07:06:34,873 INFO L226 Difference]: Without dead ends: 1296591 [2019-09-10 07:06:34,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:06:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296591 states. [2019-09-10 07:06:42,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296591 to 232358. [2019-09-10 07:06:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232358 states. [2019-09-10 07:06:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232358 states to 232358 states and 329855 transitions. [2019-09-10 07:06:43,188 INFO L78 Accepts]: Start accepts. Automaton has 232358 states and 329855 transitions. Word has length 81 [2019-09-10 07:06:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:43,189 INFO L475 AbstractCegarLoop]: Abstraction has 232358 states and 329855 transitions. [2019-09-10 07:06:43,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:06:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 232358 states and 329855 transitions. [2019-09-10 07:06:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:06:43,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:43,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:43,195 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:43,195 INFO L82 PathProgramCache]: Analyzing trace with hash 197201132, now seen corresponding path program 1 times [2019-09-10 07:06:43,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:43,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:43,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:43,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:43,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:06:43,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:43,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:06:43,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:06:43,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:06:43,578 INFO L87 Difference]: Start difference. First operand 232358 states and 329855 transitions. Second operand 13 states. [2019-09-10 07:06:44,688 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:06:44,847 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:06:45,034 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:06:45,210 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:06:45,461 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:06:45,654 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:06:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:50,056 INFO L93 Difference]: Finished difference Result 1122940 states and 1589849 transitions. [2019-09-10 07:06:50,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:06:50,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2019-09-10 07:06:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:51,740 INFO L225 Difference]: With dead ends: 1122940 [2019-09-10 07:06:51,740 INFO L226 Difference]: Without dead ends: 1122940 [2019-09-10 07:06:51,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:06:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122940 states. [2019-09-10 07:07:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122940 to 229740. [2019-09-10 07:07:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229740 states. [2019-09-10 07:07:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229740 states to 229740 states and 326267 transitions. [2019-09-10 07:07:12,879 INFO L78 Accepts]: Start accepts. Automaton has 229740 states and 326267 transitions. Word has length 81 [2019-09-10 07:07:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:12,879 INFO L475 AbstractCegarLoop]: Abstraction has 229740 states and 326267 transitions. [2019-09-10 07:07:12,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:07:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 229740 states and 326267 transitions. [2019-09-10 07:07:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:07:12,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:12,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:12,886 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1735504503, now seen corresponding path program 1 times [2019-09-10 07:07:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:12,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:12,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:12,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:12,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:12,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:12,940 INFO L87 Difference]: Start difference. First operand 229740 states and 326267 transitions. Second operand 3 states. [2019-09-10 07:07:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:13,808 INFO L93 Difference]: Finished difference Result 348016 states and 494028 transitions. [2019-09-10 07:07:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:13,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:07:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:14,285 INFO L225 Difference]: With dead ends: 348016 [2019-09-10 07:07:14,285 INFO L226 Difference]: Without dead ends: 348016 [2019-09-10 07:07:14,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348016 states. [2019-09-10 07:07:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348016 to 218465. [2019-09-10 07:07:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218465 states. [2019-09-10 07:07:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218465 states to 218465 states and 310043 transitions. [2019-09-10 07:07:22,675 INFO L78 Accepts]: Start accepts. Automaton has 218465 states and 310043 transitions. Word has length 82 [2019-09-10 07:07:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:22,675 INFO L475 AbstractCegarLoop]: Abstraction has 218465 states and 310043 transitions. [2019-09-10 07:07:22,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 218465 states and 310043 transitions. [2019-09-10 07:07:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:07:22,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:22,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:22,682 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:22,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash 125635843, now seen corresponding path program 1 times [2019-09-10 07:07:22,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:22,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:22,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:22,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:22,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:22,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:22,722 INFO L87 Difference]: Start difference. First operand 218465 states and 310043 transitions. Second operand 3 states. [2019-09-10 07:07:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:24,142 INFO L93 Difference]: Finished difference Result 342057 states and 484309 transitions. [2019-09-10 07:07:24,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:24,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:07:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:24,615 INFO L225 Difference]: With dead ends: 342057 [2019-09-10 07:07:24,615 INFO L226 Difference]: Without dead ends: 342057 [2019-09-10 07:07:24,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342057 states. [2019-09-10 07:07:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342057 to 270151. [2019-09-10 07:07:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270151 states. [2019-09-10 07:07:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270151 states to 270151 states and 383652 transitions. [2019-09-10 07:07:32,502 INFO L78 Accepts]: Start accepts. Automaton has 270151 states and 383652 transitions. Word has length 82 [2019-09-10 07:07:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:32,503 INFO L475 AbstractCegarLoop]: Abstraction has 270151 states and 383652 transitions. [2019-09-10 07:07:32,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:32,503 INFO L276 IsEmpty]: Start isEmpty. Operand 270151 states and 383652 transitions. [2019-09-10 07:07:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:32,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:32,508 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:32,509 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash -673243998, now seen corresponding path program 1 times [2019-09-10 07:07:32,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:32,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:32,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:32,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:32,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:32,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:32,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:32,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:32,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:32,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:32,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:32,559 INFO L87 Difference]: Start difference. First operand 270151 states and 383652 transitions. Second operand 3 states. [2019-09-10 07:07:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:34,162 INFO L93 Difference]: Finished difference Result 254147 states and 357651 transitions. [2019-09-10 07:07:34,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:34,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:07:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:34,543 INFO L225 Difference]: With dead ends: 254147 [2019-09-10 07:07:34,544 INFO L226 Difference]: Without dead ends: 254147 [2019-09-10 07:07:34,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254147 states. [2019-09-10 07:07:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254147 to 254145. [2019-09-10 07:07:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254145 states. [2019-09-10 07:07:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254145 states to 254145 states and 357650 transitions. [2019-09-10 07:07:41,329 INFO L78 Accepts]: Start accepts. Automaton has 254145 states and 357650 transitions. Word has length 84 [2019-09-10 07:07:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:41,329 INFO L475 AbstractCegarLoop]: Abstraction has 254145 states and 357650 transitions. [2019-09-10 07:07:41,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 254145 states and 357650 transitions. [2019-09-10 07:07:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:07:41,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:41,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:41,335 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1970137392, now seen corresponding path program 1 times [2019-09-10 07:07:41,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:41,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:41,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:41,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:41,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:41,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:41,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:41,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:41,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:41,380 INFO L87 Difference]: Start difference. First operand 254145 states and 357650 transitions. Second operand 3 states. [2019-09-10 07:07:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:42,063 INFO L93 Difference]: Finished difference Result 240677 states and 334336 transitions. [2019-09-10 07:07:42,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:42,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:07:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:42,366 INFO L225 Difference]: With dead ends: 240677 [2019-09-10 07:07:42,366 INFO L226 Difference]: Without dead ends: 240677 [2019-09-10 07:07:42,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240677 states. [2019-09-10 07:07:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240677 to 240675. [2019-09-10 07:07:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240675 states. [2019-09-10 07:07:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240675 states to 240675 states and 334335 transitions. [2019-09-10 07:07:50,358 INFO L78 Accepts]: Start accepts. Automaton has 240675 states and 334335 transitions. Word has length 85 [2019-09-10 07:07:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:50,359 INFO L475 AbstractCegarLoop]: Abstraction has 240675 states and 334335 transitions. [2019-09-10 07:07:50,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 240675 states and 334335 transitions. [2019-09-10 07:07:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:07:50,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:50,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:50,365 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:50,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:50,365 INFO L82 PathProgramCache]: Analyzing trace with hash -765372234, now seen corresponding path program 1 times [2019-09-10 07:07:50,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:50,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:50,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:51,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:51,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:07:51,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:51,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:07:51,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:07:51,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:07:51,320 INFO L87 Difference]: Start difference. First operand 240675 states and 334335 transitions. Second operand 19 states. [2019-09-10 07:07:51,979 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 07:07:52,179 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:07:52,522 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-09-10 07:07:52,821 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-09-10 07:07:53,055 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:07:53,247 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:07:53,667 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:07:53,919 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:07:54,123 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:07:54,648 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-10 07:07:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:56,300 INFO L93 Difference]: Finished difference Result 357426 states and 495607 transitions. [2019-09-10 07:07:56,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:07:56,302 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2019-09-10 07:07:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:56,781 INFO L225 Difference]: With dead ends: 357426 [2019-09-10 07:07:56,782 INFO L226 Difference]: Without dead ends: 357426 [2019-09-10 07:07:56,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:07:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357426 states. [2019-09-10 07:08:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357426 to 240661. [2019-09-10 07:08:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240661 states. [2019-09-10 07:08:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240661 states to 240661 states and 334317 transitions. [2019-09-10 07:08:00,670 INFO L78 Accepts]: Start accepts. Automaton has 240661 states and 334317 transitions. Word has length 86 [2019-09-10 07:08:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:00,670 INFO L475 AbstractCegarLoop]: Abstraction has 240661 states and 334317 transitions. [2019-09-10 07:08:00,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:08:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 240661 states and 334317 transitions. [2019-09-10 07:08:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:08:00,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:00,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:00,676 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash -231226448, now seen corresponding path program 1 times [2019-09-10 07:08:00,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:00,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:00,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:00,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:00,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:00,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:00,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:00,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:00,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:00,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:00,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:00,721 INFO L87 Difference]: Start difference. First operand 240661 states and 334317 transitions. Second operand 3 states. [2019-09-10 07:08:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:02,547 INFO L93 Difference]: Finished difference Result 376333 states and 521874 transitions. [2019-09-10 07:08:02,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:02,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:08:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:03,066 INFO L225 Difference]: With dead ends: 376333 [2019-09-10 07:08:03,066 INFO L226 Difference]: Without dead ends: 376333 [2019-09-10 07:08:03,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376333 states. [2019-09-10 07:08:11,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376333 to 240408. [2019-09-10 07:08:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240408 states. [2019-09-10 07:08:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240408 states to 240408 states and 333344 transitions. [2019-09-10 07:08:12,256 INFO L78 Accepts]: Start accepts. Automaton has 240408 states and 333344 transitions. Word has length 86 [2019-09-10 07:08:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:12,257 INFO L475 AbstractCegarLoop]: Abstraction has 240408 states and 333344 transitions. [2019-09-10 07:08:12,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 240408 states and 333344 transitions. [2019-09-10 07:08:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:08:12,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:12,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:12,262 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash -125756554, now seen corresponding path program 1 times [2019-09-10 07:08:12,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:12,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:12,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:12,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:12,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:12,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:12,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:12,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:12,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:12,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:12,300 INFO L87 Difference]: Start difference. First operand 240408 states and 333344 transitions. Second operand 3 states. [2019-09-10 07:08:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:13,052 INFO L93 Difference]: Finished difference Result 321745 states and 445613 transitions. [2019-09-10 07:08:13,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:13,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:08:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:13,506 INFO L225 Difference]: With dead ends: 321745 [2019-09-10 07:08:13,506 INFO L226 Difference]: Without dead ends: 321745 [2019-09-10 07:08:13,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321745 states. [2019-09-10 07:08:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321745 to 234568. [2019-09-10 07:08:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234568 states. [2019-09-10 07:08:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234568 states to 234568 states and 324669 transitions. [2019-09-10 07:08:18,161 INFO L78 Accepts]: Start accepts. Automaton has 234568 states and 324669 transitions. Word has length 86 [2019-09-10 07:08:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:18,162 INFO L475 AbstractCegarLoop]: Abstraction has 234568 states and 324669 transitions. [2019-09-10 07:08:18,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 234568 states and 324669 transitions. [2019-09-10 07:08:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:08:18,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:18,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:18,166 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:18,167 INFO L82 PathProgramCache]: Analyzing trace with hash 863846170, now seen corresponding path program 1 times [2019-09-10 07:08:18,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:18,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:18,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:18,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:18,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:19,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:19,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:08:19,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:19,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:08:19,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:08:19,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:08:19,006 INFO L87 Difference]: Start difference. First operand 234568 states and 324669 transitions. Second operand 18 states. [2019-09-10 07:08:19,697 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:08:19,909 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:08:20,672 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:08:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:28,674 INFO L93 Difference]: Finished difference Result 934934 states and 1296313 transitions. [2019-09-10 07:08:28,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:08:28,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-09-10 07:08:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:31,121 INFO L225 Difference]: With dead ends: 934934 [2019-09-10 07:08:31,121 INFO L226 Difference]: Without dead ends: 934934 [2019-09-10 07:08:31,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:08:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934934 states. [2019-09-10 07:08:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934934 to 234578. [2019-09-10 07:08:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234578 states. [2019-09-10 07:08:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234578 states to 234578 states and 324677 transitions. [2019-09-10 07:08:37,585 INFO L78 Accepts]: Start accepts. Automaton has 234578 states and 324677 transitions. Word has length 87 [2019-09-10 07:08:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:37,585 INFO L475 AbstractCegarLoop]: Abstraction has 234578 states and 324677 transitions. [2019-09-10 07:08:37,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:08:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 234578 states and 324677 transitions. [2019-09-10 07:08:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:08:37,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:37,605 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:37,605 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash -272713558, now seen corresponding path program 1 times [2019-09-10 07:08:37,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:37,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:37,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:37,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:37,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:37,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:37,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:37,652 INFO L87 Difference]: Start difference. First operand 234578 states and 324677 transitions. Second operand 3 states. [2019-09-10 07:08:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:38,711 INFO L93 Difference]: Finished difference Result 438408 states and 599920 transitions. [2019-09-10 07:08:38,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:38,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 07:08:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:40,693 INFO L225 Difference]: With dead ends: 438408 [2019-09-10 07:08:40,694 INFO L226 Difference]: Without dead ends: 438408 [2019-09-10 07:08:40,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438408 states. [2019-09-10 07:08:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438408 to 402229. [2019-09-10 07:08:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402229 states. [2019-09-10 07:08:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402229 states to 402229 states and 554952 transitions. [2019-09-10 07:08:52,014 INFO L78 Accepts]: Start accepts. Automaton has 402229 states and 554952 transitions. Word has length 95 [2019-09-10 07:08:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:52,015 INFO L475 AbstractCegarLoop]: Abstraction has 402229 states and 554952 transitions. [2019-09-10 07:08:52,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 402229 states and 554952 transitions. [2019-09-10 07:08:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:08:52,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:52,033 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:52,033 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:52,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1209648034, now seen corresponding path program 1 times [2019-09-10 07:08:52,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:52,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:52,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:52,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:52,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:52,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:52,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:52,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:52,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:52,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:52,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:52,090 INFO L87 Difference]: Start difference. First operand 402229 states and 554952 transitions. Second operand 3 states. [2019-09-10 07:08:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:55,918 INFO L93 Difference]: Finished difference Result 766593 states and 1037891 transitions. [2019-09-10 07:08:55,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:55,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 07:08:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:57,048 INFO L225 Difference]: With dead ends: 766593 [2019-09-10 07:08:57,048 INFO L226 Difference]: Without dead ends: 766593 [2019-09-10 07:08:57,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766593 states. [2019-09-10 07:09:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766593 to 716728. [2019-09-10 07:09:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716728 states. [2019-09-10 07:09:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716728 states to 716728 states and 972471 transitions. [2019-09-10 07:09:13,040 INFO L78 Accepts]: Start accepts. Automaton has 716728 states and 972471 transitions. Word has length 96 [2019-09-10 07:09:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:13,040 INFO L475 AbstractCegarLoop]: Abstraction has 716728 states and 972471 transitions. [2019-09-10 07:09:13,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 716728 states and 972471 transitions. [2019-09-10 07:09:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:09:13,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:13,050 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:13,050 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:13,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1706098489, now seen corresponding path program 1 times [2019-09-10 07:09:13,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:13,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:13,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:13,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:13,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:13,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:13,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:13,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:13,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:13,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:13,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:13,093 INFO L87 Difference]: Start difference. First operand 716728 states and 972471 transitions. Second operand 3 states. [2019-09-10 07:09:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:19,778 INFO L93 Difference]: Finished difference Result 1133726 states and 1526214 transitions. [2019-09-10 07:09:19,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:19,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:09:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:21,741 INFO L225 Difference]: With dead ends: 1133726 [2019-09-10 07:09:21,741 INFO L226 Difference]: Without dead ends: 1133726 [2019-09-10 07:09:21,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133726 states. [2019-09-10 07:09:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133726 to 1073558. [2019-09-10 07:09:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073558 states. [2019-09-10 07:10:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073558 states to 1073558 states and 1451945 transitions. [2019-09-10 07:10:04,694 INFO L78 Accepts]: Start accepts. Automaton has 1073558 states and 1451945 transitions. Word has length 97 [2019-09-10 07:10:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:04,695 INFO L475 AbstractCegarLoop]: Abstraction has 1073558 states and 1451945 transitions. [2019-09-10 07:10:04,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:10:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1073558 states and 1451945 transitions. [2019-09-10 07:10:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:10:04,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:04,708 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:10:04,708 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1592098527, now seen corresponding path program 1 times [2019-09-10 07:10:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:04,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:04,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:04,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:04,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:10:04,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:04,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:10:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:10:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:10:04,772 INFO L87 Difference]: Start difference. First operand 1073558 states and 1451945 transitions. Second operand 3 states. [2019-09-10 07:10:08,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:08,422 INFO L93 Difference]: Finished difference Result 944938 states and 1264431 transitions. [2019-09-10 07:10:08,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:10:08,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 07:10:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:09,880 INFO L225 Difference]: With dead ends: 944938 [2019-09-10 07:10:09,881 INFO L226 Difference]: Without dead ends: 944938 [2019-09-10 07:10:09,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:10:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944938 states. [2019-09-10 07:10:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944938 to 730294. [2019-09-10 07:10:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730294 states. [2019-09-10 07:10:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730294 states to 730294 states and 977116 transitions. [2019-09-10 07:10:31,920 INFO L78 Accepts]: Start accepts. Automaton has 730294 states and 977116 transitions. Word has length 108 [2019-09-10 07:10:31,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:31,920 INFO L475 AbstractCegarLoop]: Abstraction has 730294 states and 977116 transitions. [2019-09-10 07:10:31,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:10:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 730294 states and 977116 transitions. [2019-09-10 07:10:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:10:31,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:31,933 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:10:31,933 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 541704435, now seen corresponding path program 1 times [2019-09-10 07:10:31,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:31,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:31,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:31,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:31,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:10:31,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:31,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:10:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:10:31,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:10:31,990 INFO L87 Difference]: Start difference. First operand 730294 states and 977116 transitions. Second operand 5 states. [2019-09-10 07:10:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:47,152 INFO L93 Difference]: Finished difference Result 1292366 states and 1674752 transitions. [2019-09-10 07:10:47,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:10:47,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 07:10:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:49,547 INFO L225 Difference]: With dead ends: 1292366 [2019-09-10 07:10:49,547 INFO L226 Difference]: Without dead ends: 1292366 [2019-09-10 07:10:49,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:10:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292366 states. [2019-09-10 07:11:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292366 to 804512. [2019-09-10 07:11:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804512 states. [2019-09-10 07:11:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804512 states to 804512 states and 1061880 transitions. [2019-09-10 07:11:07,250 INFO L78 Accepts]: Start accepts. Automaton has 804512 states and 1061880 transitions. Word has length 110 [2019-09-10 07:11:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:07,250 INFO L475 AbstractCegarLoop]: Abstraction has 804512 states and 1061880 transitions. [2019-09-10 07:11:07,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:11:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 804512 states and 1061880 transitions. [2019-09-10 07:11:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:11:07,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:07,285 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-10 07:11:07,285 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:07,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:07,285 INFO L82 PathProgramCache]: Analyzing trace with hash -691462741, now seen corresponding path program 1 times [2019-09-10 07:11:07,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:07,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:07,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:11:07,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:07,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:07,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:07,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:07,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:07,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:07,336 INFO L87 Difference]: Start difference. First operand 804512 states and 1061880 transitions. Second operand 3 states. [2019-09-10 07:11:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:26,371 INFO L93 Difference]: Finished difference Result 1524778 states and 1970549 transitions. [2019-09-10 07:11:26,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:26,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 07:11:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:29,431 INFO L225 Difference]: With dead ends: 1524778 [2019-09-10 07:11:29,432 INFO L226 Difference]: Without dead ends: 1524778 [2019-09-10 07:11:29,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524778 states. [2019-09-10 07:11:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524778 to 1349802. [2019-09-10 07:11:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349802 states. [2019-09-10 07:12:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349802 states to 1349802 states and 1766748 transitions. [2019-09-10 07:12:07,878 INFO L78 Accepts]: Start accepts. Automaton has 1349802 states and 1766748 transitions. Word has length 118 [2019-09-10 07:12:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:07,879 INFO L475 AbstractCegarLoop]: Abstraction has 1349802 states and 1766748 transitions. [2019-09-10 07:12:07,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:12:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1349802 states and 1766748 transitions. [2019-09-10 07:12:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 07:12:07,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:07,907 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:07,908 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:07,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1046523182, now seen corresponding path program 1 times [2019-09-10 07:12:07,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:07,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:07,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:08,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:12:08,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:12:08,118 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2019-09-10 07:12:08,121 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [88], [90], [92], [96], [109], [113], [126], [130], [143], [146], [149], [153], [156], [160], [171], [174], [177], [185], [188], [199], [202], [213], [215], [218], [221], [223], [226], [227], [229], [232], [237], [248], [250], [253], [264], [266], [269], [280], [282], [285], [296], [308], [310], [323], [331], [350], [361], [363], [376], [384], [403], [414], [416], [429], [437], [456], [467], [469], [471], [474], [477], [480], [482], [484], [513], [518], [531], [543], [553], [567], [575], [591], [596], [612], [617], [633], [682], [683], [687], [688], [689] [2019-09-10 07:12:08,182 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:12:08,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:12:08,326 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:12:09,077 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:12:09,080 INFO L272 AbstractInterpreter]: Visited 110 different actions 599 times. Merged at 44 different actions 427 times. Widened at 13 different actions 43 times. Performed 1900 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1900 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 67 fixpoints after 15 different actions. Largest state had 132 variables. [2019-09-10 07:12:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:09,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:12:09,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:12:09,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:12:09,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:09,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:12:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:09,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 07:12:09,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:12:09,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:12:09,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:12:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:10,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:12:13,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:12:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:13,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:12:13,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-09-10 07:12:13,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:12:13,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:12:13,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:12:13,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:12:13,272 INFO L87 Difference]: Start difference. First operand 1349802 states and 1766748 transitions. Second operand 19 states. [2019-09-10 07:12:13,725 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:12:13,865 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:12:15,318 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 07:12:16,880 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:12:17,515 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:12:20,554 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:12:20,989 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:12:22,450 WARN L188 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:12:23,595 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 07:12:24,271 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 07:12:25,017 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:12:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:55,171 INFO L93 Difference]: Finished difference Result 5306246 states and 6846045 transitions. [2019-09-10 07:12:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 07:12:55,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2019-09-10 07:12:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted.