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.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:25:20,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:25:20,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:25:20,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:25:20,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:25:20,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:25:20,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:25:20,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:25:20,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:25:20,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:25:20,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:25:20,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:25:20,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:25:20,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:25:20,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:25:20,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:25:20,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:25:20,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:25:20,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:25:20,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:25:20,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:25:20,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:25:20,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:25:20,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:25:20,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:25:20,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:25:20,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:25:20,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:25:20,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:25:20,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:25:20,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:25:20,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:25:20,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:25:20,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:25:20,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:25:20,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:25:20,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:25:20,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:25:20,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:25:20,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:25:20,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:25:20,824 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:25:20,854 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:25:20,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:25:20,855 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:25:20,856 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:25:20,856 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:25:20,857 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:25:20,857 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:25:20,857 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:25:20,857 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:25:20,858 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:25:20,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:25:20,860 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:25:20,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:25:20,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:25:20,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:25:20,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:25:20,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:25:20,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:25:20,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:25:20,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:25:20,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:25:20,863 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:25:20,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:25:20,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:25:20,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:25:20,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:25:20,864 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:25:20,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:25:20,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:25:20,864 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:25:20,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:25:20,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:25:20,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:25:20,925 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:25:20,925 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:25:20,926 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.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-10 07:25:20,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b86ca9c0/9ecb7042ebd64619bdbf89eba9058c03/FLAG9b48e6681 [2019-09-10 07:25:21,581 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:25:21,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-10 07:25:21,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b86ca9c0/9ecb7042ebd64619bdbf89eba9058c03/FLAG9b48e6681 [2019-09-10 07:25:21,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b86ca9c0/9ecb7042ebd64619bdbf89eba9058c03 [2019-09-10 07:25:21,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:25:21,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:25:21,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:21,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:25:21,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:25:21,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:21" (1/1) ... [2019-09-10 07:25:21,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c3f56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:21, skipping insertion in model container [2019-09-10 07:25:21,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:21" (1/1) ... [2019-09-10 07:25:21,878 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:25:21,952 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:25:22,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:22,475 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:25:22,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:22,637 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:25:22,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22 WrapperNode [2019-09-10 07:25:22,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:22,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:25:22,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:25:22,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:25:22,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:25:22,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:25:22,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:25:22,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:25:22,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (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:25:22,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:25:22,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:25:22,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:25:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:25:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:25:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:25:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:25:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:25:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:25:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:25:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:25:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:25:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:25:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:25:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:25:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:25:22,826 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:25:22,826 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:25:22,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:25:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:25:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:25:24,232 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:25:24,234 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:25:24,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:24 BoogieIcfgContainer [2019-09-10 07:25:24,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:25:24,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:25:24,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:25:24,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:25:24,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:25:21" (1/3) ... [2019-09-10 07:25:24,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19137650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:24, skipping insertion in model container [2019-09-10 07:25:24,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (2/3) ... [2019-09-10 07:25:24,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19137650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:24, skipping insertion in model container [2019-09-10 07:25:24,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:24" (3/3) ... [2019-09-10 07:25:24,250 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-10 07:25:24,261 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:25:24,269 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:25:24,287 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:25:24,313 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:25:24,313 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:25:24,313 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:25:24,313 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:25:24,313 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:25:24,313 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:25:24,314 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:25:24,314 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:25:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states. [2019-09-10 07:25:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:25:24,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:24,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:24,358 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash -515366270, now seen corresponding path program 1 times [2019-09-10 07:25:24,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:24,948 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:25:24,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:24,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:24,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:24,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:24,978 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 3 states. [2019-09-10 07:25:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:25,138 INFO L93 Difference]: Finished difference Result 408 states and 677 transitions. [2019-09-10 07:25:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:25,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:25:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:25,159 INFO L225 Difference]: With dead ends: 408 [2019-09-10 07:25:25,159 INFO L226 Difference]: Without dead ends: 400 [2019-09-10 07:25:25,161 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:25:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-10 07:25:25,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2019-09-10 07:25:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-10 07:25:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 594 transitions. [2019-09-10 07:25:25,251 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 594 transitions. Word has length 101 [2019-09-10 07:25:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:25,256 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 594 transitions. [2019-09-10 07:25:25,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 594 transitions. [2019-09-10 07:25:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:25:25,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:25,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:25,269 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash 862673413, now seen corresponding path program 1 times [2019-09-10 07:25:25,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:25,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:25,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:25,740 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:25:25,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:25,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:25:25,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:25,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:25:25,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:25:25,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:25:25,745 INFO L87 Difference]: Start difference. First operand 398 states and 594 transitions. Second operand 8 states. [2019-09-10 07:25:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:26,225 INFO L93 Difference]: Finished difference Result 1669 states and 2567 transitions. [2019-09-10 07:25:26,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:25:26,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-10 07:25:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:26,237 INFO L225 Difference]: With dead ends: 1669 [2019-09-10 07:25:26,237 INFO L226 Difference]: Without dead ends: 1669 [2019-09-10 07:25:26,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:25:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-10 07:25:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1659. [2019-09-10 07:25:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-09-10 07:25:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2562 transitions. [2019-09-10 07:25:26,308 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2562 transitions. Word has length 102 [2019-09-10 07:25:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:26,309 INFO L475 AbstractCegarLoop]: Abstraction has 1659 states and 2562 transitions. [2019-09-10 07:25:26,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:25:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2562 transitions. [2019-09-10 07:25:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:25:26,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:26,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:26,323 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:26,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1435350370, now seen corresponding path program 1 times [2019-09-10 07:25:26,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:26,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:26,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:26,519 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:25:26,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:26,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:25:26,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:26,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:25:26,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:25:26,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:25:26,521 INFO L87 Difference]: Start difference. First operand 1659 states and 2562 transitions. Second operand 6 states. [2019-09-10 07:25:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:27,119 INFO L93 Difference]: Finished difference Result 4181 states and 6525 transitions. [2019-09-10 07:25:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:27,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-09-10 07:25:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:27,143 INFO L225 Difference]: With dead ends: 4181 [2019-09-10 07:25:27,144 INFO L226 Difference]: Without dead ends: 4181 [2019-09-10 07:25:27,144 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:25:27,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-09-10 07:25:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4177. [2019-09-10 07:25:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4177 states. [2019-09-10 07:25:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 6523 transitions. [2019-09-10 07:25:27,245 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 6523 transitions. Word has length 103 [2019-09-10 07:25:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:27,246 INFO L475 AbstractCegarLoop]: Abstraction has 4177 states and 6523 transitions. [2019-09-10 07:25:27,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:25:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 6523 transitions. [2019-09-10 07:25:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:25:27,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:27,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:27,251 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:27,252 INFO L82 PathProgramCache]: Analyzing trace with hash -49006449, now seen corresponding path program 1 times [2019-09-10 07:25:27,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:27,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:27,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:27,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:27,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:27,406 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:25:27,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:27,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:27,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:27,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:27,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:27,409 INFO L87 Difference]: Start difference. First operand 4177 states and 6523 transitions. Second operand 5 states. [2019-09-10 07:25:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:27,890 INFO L93 Difference]: Finished difference Result 7519 states and 11732 transitions. [2019-09-10 07:25:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:27,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:25:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:27,939 INFO L225 Difference]: With dead ends: 7519 [2019-09-10 07:25:27,939 INFO L226 Difference]: Without dead ends: 7519 [2019-09-10 07:25:27,940 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:25:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7519 states. [2019-09-10 07:25:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7519 to 7517. [2019-09-10 07:25:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7517 states. [2019-09-10 07:25:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7517 states to 7517 states and 11731 transitions. [2019-09-10 07:25:28,149 INFO L78 Accepts]: Start accepts. Automaton has 7517 states and 11731 transitions. Word has length 103 [2019-09-10 07:25:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:28,149 INFO L475 AbstractCegarLoop]: Abstraction has 7517 states and 11731 transitions. [2019-09-10 07:25:28,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7517 states and 11731 transitions. [2019-09-10 07:25:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:25:28,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:28,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, 1, 1, 1, 1, 1, 1, 1, 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:25:28,156 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:28,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:28,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1556143714, now seen corresponding path program 1 times [2019-09-10 07:25:28,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:28,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:28,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:28,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:28,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:28,265 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:25:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:28,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:28,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:28,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:28,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:28,267 INFO L87 Difference]: Start difference. First operand 7517 states and 11731 transitions. Second operand 5 states. [2019-09-10 07:25:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:28,782 INFO L93 Difference]: Finished difference Result 14147 states and 22072 transitions. [2019-09-10 07:25:28,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:28,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:25:28,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:28,903 INFO L225 Difference]: With dead ends: 14147 [2019-09-10 07:25:28,904 INFO L226 Difference]: Without dead ends: 14147 [2019-09-10 07:25:28,904 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:25:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14147 states. [2019-09-10 07:25:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14147 to 14145. [2019-09-10 07:25:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14145 states. [2019-09-10 07:25:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 22071 transitions. [2019-09-10 07:25:29,341 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 22071 transitions. Word has length 103 [2019-09-10 07:25:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:29,342 INFO L475 AbstractCegarLoop]: Abstraction has 14145 states and 22071 transitions. [2019-09-10 07:25:29,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 22071 transitions. [2019-09-10 07:25:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:25:29,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:29,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:29,350 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash 202933120, now seen corresponding path program 1 times [2019-09-10 07:25:29,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:29,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:29,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:29,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:29,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:29,455 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:25:29,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:29,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:29,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:29,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:29,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:29,458 INFO L87 Difference]: Start difference. First operand 14145 states and 22071 transitions. Second operand 5 states. [2019-09-10 07:25:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:29,965 INFO L93 Difference]: Finished difference Result 27577 states and 42889 transitions. [2019-09-10 07:25:29,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:29,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:25:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:30,206 INFO L225 Difference]: With dead ends: 27577 [2019-09-10 07:25:30,207 INFO L226 Difference]: Without dead ends: 27577 [2019-09-10 07:25:30,207 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:25:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27577 states. [2019-09-10 07:25:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27577 to 27575. [2019-09-10 07:25:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27575 states. [2019-09-10 07:25:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27575 states to 27575 states and 42888 transitions. [2019-09-10 07:25:30,748 INFO L78 Accepts]: Start accepts. Automaton has 27575 states and 42888 transitions. Word has length 103 [2019-09-10 07:25:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:30,750 INFO L475 AbstractCegarLoop]: Abstraction has 27575 states and 42888 transitions. [2019-09-10 07:25:30,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 27575 states and 42888 transitions. [2019-09-10 07:25:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:25:30,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:30,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:30,777 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:30,780 INFO L82 PathProgramCache]: Analyzing trace with hash -76299663, now seen corresponding path program 1 times [2019-09-10 07:25:30,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:30,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:30,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:30,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:30,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:30,892 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:25:30,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:30,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:30,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:30,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:30,895 INFO L87 Difference]: Start difference. First operand 27575 states and 42888 transitions. Second operand 5 states. [2019-09-10 07:25:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:31,996 INFO L93 Difference]: Finished difference Result 54541 states and 84469 transitions. [2019-09-10 07:25:31,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:31,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:25:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:32,152 INFO L225 Difference]: With dead ends: 54541 [2019-09-10 07:25:32,152 INFO L226 Difference]: Without dead ends: 54541 [2019-09-10 07:25:32,153 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:25:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54541 states. [2019-09-10 07:25:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54541 to 54539. [2019-09-10 07:25:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54539 states. [2019-09-10 07:25:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54539 states to 54539 states and 84468 transitions. [2019-09-10 07:25:33,205 INFO L78 Accepts]: Start accepts. Automaton has 54539 states and 84468 transitions. Word has length 103 [2019-09-10 07:25:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:33,205 INFO L475 AbstractCegarLoop]: Abstraction has 54539 states and 84468 transitions. [2019-09-10 07:25:33,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 54539 states and 84468 transitions. [2019-09-10 07:25:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:25:33,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:33,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:33,219 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:33,220 INFO L82 PathProgramCache]: Analyzing trace with hash -737272749, now seen corresponding path program 1 times [2019-09-10 07:25:33,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:33,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:33,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:33,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:33,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:33,371 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:25:33,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:33,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:33,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:33,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:33,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:33,375 INFO L87 Difference]: Start difference. First operand 54539 states and 84468 transitions. Second operand 5 states. [2019-09-10 07:25:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:35,212 INFO L93 Difference]: Finished difference Result 101057 states and 155577 transitions. [2019-09-10 07:25:35,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:35,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:25:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:35,390 INFO L225 Difference]: With dead ends: 101057 [2019-09-10 07:25:35,391 INFO L226 Difference]: Without dead ends: 101057 [2019-09-10 07:25:35,391 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:25:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101057 states. [2019-09-10 07:25:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101057 to 101055. [2019-09-10 07:25:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101055 states. [2019-09-10 07:25:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101055 states to 101055 states and 155576 transitions. [2019-09-10 07:25:36,770 INFO L78 Accepts]: Start accepts. Automaton has 101055 states and 155576 transitions. Word has length 103 [2019-09-10 07:25:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:36,770 INFO L475 AbstractCegarLoop]: Abstraction has 101055 states and 155576 transitions. [2019-09-10 07:25:36,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 101055 states and 155576 transitions. [2019-09-10 07:25:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:25:36,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:36,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:36,791 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash 303097242, now seen corresponding path program 1 times [2019-09-10 07:25:36,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:36,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:36,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:36,910 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:25:36,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:36,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:36,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:36,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:36,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:36,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:36,912 INFO L87 Difference]: Start difference. First operand 101055 states and 155576 transitions. Second operand 5 states. [2019-09-10 07:25:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:39,119 INFO L93 Difference]: Finished difference Result 191471 states and 293128 transitions. [2019-09-10 07:25:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:25:39,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 07:25:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:39,450 INFO L225 Difference]: With dead ends: 191471 [2019-09-10 07:25:39,450 INFO L226 Difference]: Without dead ends: 191471 [2019-09-10 07:25:39,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:25:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191471 states. [2019-09-10 07:25:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191471 to 102111. [2019-09-10 07:25:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102111 states. [2019-09-10 07:25:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102111 states to 102111 states and 156632 transitions. [2019-09-10 07:25:41,624 INFO L78 Accepts]: Start accepts. Automaton has 102111 states and 156632 transitions. Word has length 104 [2019-09-10 07:25:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:41,625 INFO L475 AbstractCegarLoop]: Abstraction has 102111 states and 156632 transitions. [2019-09-10 07:25:41,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 102111 states and 156632 transitions. [2019-09-10 07:25:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:25:41,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:41,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:41,652 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:41,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1148405721, now seen corresponding path program 1 times [2019-09-10 07:25:41,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:41,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:41,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:41,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:42,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:25:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:42,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:25:42,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:42,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:25:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:25:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:25:42,321 INFO L87 Difference]: Start difference. First operand 102111 states and 156632 transitions. Second operand 4 states. [2019-09-10 07:25:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:42,901 INFO L93 Difference]: Finished difference Result 192417 states and 293145 transitions. [2019-09-10 07:25:42,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:25:42,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-10 07:25:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:43,192 INFO L225 Difference]: With dead ends: 192417 [2019-09-10 07:25:43,193 INFO L226 Difference]: Without dead ends: 192417 [2019-09-10 07:25:43,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:25:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192417 states. [2019-09-10 07:25:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192417 to 192415. [2019-09-10 07:25:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192415 states. [2019-09-10 07:25:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192415 states to 192415 states and 293144 transitions. [2019-09-10 07:25:48,022 INFO L78 Accepts]: Start accepts. Automaton has 192415 states and 293144 transitions. Word has length 105 [2019-09-10 07:25:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:48,023 INFO L475 AbstractCegarLoop]: Abstraction has 192415 states and 293144 transitions. [2019-09-10 07:25:48,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:25:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 192415 states and 293144 transitions. [2019-09-10 07:25:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:25:48,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:48,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:48,042 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1796571939, now seen corresponding path program 1 times [2019-09-10 07:25:48,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:48,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:48,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:48,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:48,121 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:25:48,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:48,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:48,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:48,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:48,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:48,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:48,123 INFO L87 Difference]: Start difference. First operand 192415 states and 293144 transitions. Second operand 3 states. [2019-09-10 07:25:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:48,978 INFO L93 Difference]: Finished difference Result 254097 states and 382407 transitions. [2019-09-10 07:25:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:48,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:25:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:49,417 INFO L225 Difference]: With dead ends: 254097 [2019-09-10 07:25:49,419 INFO L226 Difference]: Without dead ends: 254097 [2019-09-10 07:25:49,421 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:25:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254097 states. [2019-09-10 07:25:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254097 to 252476. [2019-09-10 07:25:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252476 states. [2019-09-10 07:25:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252476 states to 252476 states and 380787 transitions. [2019-09-10 07:25:56,214 INFO L78 Accepts]: Start accepts. Automaton has 252476 states and 380787 transitions. Word has length 106 [2019-09-10 07:25:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:56,214 INFO L475 AbstractCegarLoop]: Abstraction has 252476 states and 380787 transitions. [2019-09-10 07:25:56,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 252476 states and 380787 transitions. [2019-09-10 07:25:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:25:56,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:56,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:56,239 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1528380005, now seen corresponding path program 1 times [2019-09-10 07:25:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:56,321 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:25:56,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:56,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:56,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:56,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:56,323 INFO L87 Difference]: Start difference. First operand 252476 states and 380787 transitions. Second operand 3 states. [2019-09-10 07:26:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:01,433 INFO L93 Difference]: Finished difference Result 304247 states and 452342 transitions. [2019-09-10 07:26:01,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:01,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:26:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:01,815 INFO L225 Difference]: With dead ends: 304247 [2019-09-10 07:26:01,816 INFO L226 Difference]: Without dead ends: 304247 [2019-09-10 07:26:01,816 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:26:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304247 states. [2019-09-10 07:26:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304247 to 302331. [2019-09-10 07:26:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302331 states. [2019-09-10 07:26:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302331 states to 302331 states and 450427 transitions. [2019-09-10 07:26:05,304 INFO L78 Accepts]: Start accepts. Automaton has 302331 states and 450427 transitions. Word has length 106 [2019-09-10 07:26:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:05,304 INFO L475 AbstractCegarLoop]: Abstraction has 302331 states and 450427 transitions. [2019-09-10 07:26:05,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 302331 states and 450427 transitions. [2019-09-10 07:26:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:05,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:05,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:05,326 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash -449321198, now seen corresponding path program 1 times [2019-09-10 07:26:05,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:05,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:05,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:05,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:05,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:05,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:26:05,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:05,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:05,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:05,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:05,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:05,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:05,394 INFO L87 Difference]: Start difference. First operand 302331 states and 450427 transitions. Second operand 3 states. [2019-09-10 07:26:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:06,489 INFO L93 Difference]: Finished difference Result 336309 states and 493384 transitions. [2019-09-10 07:26:06,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:06,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:26:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:07,408 INFO L225 Difference]: With dead ends: 336309 [2019-09-10 07:26:07,408 INFO L226 Difference]: Without dead ends: 334581 [2019-09-10 07:26:07,409 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:26:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334581 states. [2019-09-10 07:26:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334581 to 297215. [2019-09-10 07:26:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297215 states. [2019-09-10 07:26:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297215 states to 297215 states and 437407 transitions. [2019-09-10 07:26:16,110 INFO L78 Accepts]: Start accepts. Automaton has 297215 states and 437407 transitions. Word has length 106 [2019-09-10 07:26:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:16,110 INFO L475 AbstractCegarLoop]: Abstraction has 297215 states and 437407 transitions. [2019-09-10 07:26:16,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 297215 states and 437407 transitions. [2019-09-10 07:26:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:16,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:16,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:16,131 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:16,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:16,132 INFO L82 PathProgramCache]: Analyzing trace with hash -237205661, now seen corresponding path program 1 times [2019-09-10 07:26:16,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:16,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:16,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:16,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:16,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:16,201 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:26:16,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:16,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:16,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:16,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:16,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:16,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:16,203 INFO L87 Difference]: Start difference. First operand 297215 states and 437407 transitions. Second operand 3 states. [2019-09-10 07:26:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:18,111 INFO L93 Difference]: Finished difference Result 320281 states and 463398 transitions. [2019-09-10 07:26:18,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:18,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:26:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:18,670 INFO L225 Difference]: With dead ends: 320281 [2019-09-10 07:26:18,671 INFO L226 Difference]: Without dead ends: 320281 [2019-09-10 07:26:18,671 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:26:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320281 states. [2019-09-10 07:26:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320281 to 317799. [2019-09-10 07:26:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317799 states. [2019-09-10 07:26:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317799 states to 317799 states and 460917 transitions. [2019-09-10 07:26:24,429 INFO L78 Accepts]: Start accepts. Automaton has 317799 states and 460917 transitions. Word has length 106 [2019-09-10 07:26:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:24,430 INFO L475 AbstractCegarLoop]: Abstraction has 317799 states and 460917 transitions. [2019-09-10 07:26:24,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 317799 states and 460917 transitions. [2019-09-10 07:26:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:24,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:24,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:24,452 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:24,452 INFO L82 PathProgramCache]: Analyzing trace with hash -121059675, now seen corresponding path program 1 times [2019-09-10 07:26:24,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:24,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:24,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:24,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:24,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:24,573 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:26:24,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:24,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:24,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:24,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:24,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:24,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:24,575 INFO L87 Difference]: Start difference. First operand 317799 states and 460917 transitions. Second operand 7 states. [2019-09-10 07:26:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:45,998 INFO L93 Difference]: Finished difference Result 1883355 states and 2695087 transitions. [2019-09-10 07:26:45,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:26:45,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:26:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:49,235 INFO L225 Difference]: With dead ends: 1883355 [2019-09-10 07:26:49,236 INFO L226 Difference]: Without dead ends: 1883355 [2019-09-10 07:26:49,236 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:26:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883355 states. [2019-09-10 07:27:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883355 to 318431. [2019-09-10 07:27:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318431 states. [2019-09-10 07:27:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318431 states to 318431 states and 461747 transitions. [2019-09-10 07:27:09,802 INFO L78 Accepts]: Start accepts. Automaton has 318431 states and 461747 transitions. Word has length 106 [2019-09-10 07:27:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:09,803 INFO L475 AbstractCegarLoop]: Abstraction has 318431 states and 461747 transitions. [2019-09-10 07:27:09,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:27:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 318431 states and 461747 transitions. [2019-09-10 07:27:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:27:09,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:09,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:09,825 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:09,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1920757475, now seen corresponding path program 1 times [2019-09-10 07:27:09,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:09,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:09,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:09,890 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:27:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:09,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:27:09,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:09,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:27:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:27:09,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:09,895 INFO L87 Difference]: Start difference. First operand 318431 states and 461747 transitions. Second operand 3 states. [2019-09-10 07:27:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:10,953 INFO L93 Difference]: Finished difference Result 443301 states and 635156 transitions. [2019-09-10 07:27:10,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:27:10,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:27:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:11,564 INFO L225 Difference]: With dead ends: 443301 [2019-09-10 07:27:11,565 INFO L226 Difference]: Without dead ends: 443301 [2019-09-10 07:27:11,565 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:27:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443301 states. [2019-09-10 07:27:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443301 to 442369. [2019-09-10 07:27:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442369 states. [2019-09-10 07:27:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442369 states to 442369 states and 634225 transitions. [2019-09-10 07:27:26,102 INFO L78 Accepts]: Start accepts. Automaton has 442369 states and 634225 transitions. Word has length 106 [2019-09-10 07:27:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:26,102 INFO L475 AbstractCegarLoop]: Abstraction has 442369 states and 634225 transitions. [2019-09-10 07:27:26,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:27:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 442369 states and 634225 transitions. [2019-09-10 07:27:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:27:26,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:26,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:26,139 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:26,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2046382973, now seen corresponding path program 1 times [2019-09-10 07:27:26,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:26,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:26,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:26,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:26,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:26,256 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:27:26,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:26,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:27:26,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:26,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:27:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:27:26,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:27:26,258 INFO L87 Difference]: Start difference. First operand 442369 states and 634225 transitions. Second operand 7 states. [2019-09-10 07:27:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:38,934 INFO L93 Difference]: Finished difference Result 2089746 states and 2956732 transitions. [2019-09-10 07:27:38,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:27:38,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:27:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:52,755 INFO L225 Difference]: With dead ends: 2089746 [2019-09-10 07:27:52,755 INFO L226 Difference]: Without dead ends: 2089746 [2019-09-10 07:27:52,755 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:27:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089746 states. [2019-09-10 07:28:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089746 to 444474. [2019-09-10 07:28:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444474 states. [2019-09-10 07:28:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444474 states to 444474 states and 637055 transitions. [2019-09-10 07:28:08,242 INFO L78 Accepts]: Start accepts. Automaton has 444474 states and 637055 transitions. Word has length 106 [2019-09-10 07:28:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:08,243 INFO L475 AbstractCegarLoop]: Abstraction has 444474 states and 637055 transitions. [2019-09-10 07:28:08,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:28:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 444474 states and 637055 transitions. [2019-09-10 07:28:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:28:08,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:08,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:08,273 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash 772249746, now seen corresponding path program 1 times [2019-09-10 07:28:08,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:08,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:08,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:08,394 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:28:08,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:08,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:28:08,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:08,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:28:08,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:28:08,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:28:08,396 INFO L87 Difference]: Start difference. First operand 444474 states and 637055 transitions. Second operand 7 states. [2019-09-10 07:28:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:24,077 INFO L93 Difference]: Finished difference Result 1369372 states and 1935447 transitions. [2019-09-10 07:28:24,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:28:24,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:28:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:26,220 INFO L225 Difference]: With dead ends: 1369372 [2019-09-10 07:28:26,220 INFO L226 Difference]: Without dead ends: 1369372 [2019-09-10 07:28:26,220 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:28:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369372 states. [2019-09-10 07:28:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369372 to 539650. [2019-09-10 07:28:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539650 states. [2019-09-10 07:28:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539650 states to 539650 states and 771501 transitions. [2019-09-10 07:28:46,893 INFO L78 Accepts]: Start accepts. Automaton has 539650 states and 771501 transitions. Word has length 106 [2019-09-10 07:28:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:46,894 INFO L475 AbstractCegarLoop]: Abstraction has 539650 states and 771501 transitions. [2019-09-10 07:28:46,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:28:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 539650 states and 771501 transitions. [2019-09-10 07:28:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:28:46,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:46,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:46,922 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1051094235, now seen corresponding path program 1 times [2019-09-10 07:28:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:46,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:46,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:47,030 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:28:47,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:47,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:28:47,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:47,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:28:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:28:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:28:47,032 INFO L87 Difference]: Start difference. First operand 539650 states and 771501 transitions. Second operand 7 states. [2019-09-10 07:29:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:06,159 INFO L93 Difference]: Finished difference Result 2887889 states and 4075600 transitions. [2019-09-10 07:29:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:29:06,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:29:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:12,065 INFO L225 Difference]: With dead ends: 2887889 [2019-09-10 07:29:12,065 INFO L226 Difference]: Without dead ends: 2887889 [2019-09-10 07:29:12,065 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:29:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887889 states. [2019-09-10 07:29:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887889 to 541215. [2019-09-10 07:29:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541215 states. [2019-09-10 07:29:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541215 states to 541215 states and 773573 transitions. [2019-09-10 07:29:45,235 INFO L78 Accepts]: Start accepts. Automaton has 541215 states and 773573 transitions. Word has length 106 [2019-09-10 07:29:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:45,236 INFO L475 AbstractCegarLoop]: Abstraction has 541215 states and 773573 transitions. [2019-09-10 07:29:45,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:29:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 541215 states and 773573 transitions. [2019-09-10 07:29:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:29:45,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:45,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:45,268 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:45,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1954533251, now seen corresponding path program 1 times [2019-09-10 07:29:45,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:45,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:45,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:45,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:45,374 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:29:45,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:29:45,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:45,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:29:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:29:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:29:45,377 INFO L87 Difference]: Start difference. First operand 541215 states and 773573 transitions. Second operand 7 states. [2019-09-10 07:30:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:05,476 INFO L93 Difference]: Finished difference Result 3269955 states and 4618133 transitions. [2019-09-10 07:30:05,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:30:05,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:30:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:13,196 INFO L225 Difference]: With dead ends: 3269955 [2019-09-10 07:30:13,196 INFO L226 Difference]: Without dead ends: 3269955 [2019-09-10 07:30:13,196 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:30:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269955 states. [2019-09-10 07:30:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269955 to 543279. [2019-09-10 07:30:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543279 states. [2019-09-10 07:30:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543279 states to 543279 states and 776345 transitions. [2019-09-10 07:30:56,289 INFO L78 Accepts]: Start accepts. Automaton has 543279 states and 776345 transitions. Word has length 106 [2019-09-10 07:30:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:56,290 INFO L475 AbstractCegarLoop]: Abstraction has 543279 states and 776345 transitions. [2019-09-10 07:30:56,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:30:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 543279 states and 776345 transitions. [2019-09-10 07:30:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:30:56,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:56,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:30:56,325 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:56,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash -48088507, now seen corresponding path program 1 times [2019-09-10 07:30:56,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:56,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:56,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:03,728 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:31:03,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:31:03,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:31:03,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:31:03,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:31:03,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:31:03,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:31:03,731 INFO L87 Difference]: Start difference. First operand 543279 states and 776345 transitions. Second operand 3 states. [2019-09-10 07:31:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:05,832 INFO L93 Difference]: Finished difference Result 801262 states and 1126874 transitions. [2019-09-10 07:31:05,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:31:05,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:31:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:07,860 INFO L225 Difference]: With dead ends: 801262 [2019-09-10 07:31:07,861 INFO L226 Difference]: Without dead ends: 801262 [2019-09-10 07:31:07,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:31:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801262 states. [2019-09-10 07:31:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801262 to 795548. [2019-09-10 07:31:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795548 states. [2019-09-10 07:31:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795548 states to 795548 states and 1120975 transitions. [2019-09-10 07:31:31,855 INFO L78 Accepts]: Start accepts. Automaton has 795548 states and 1120975 transitions. Word has length 106 [2019-09-10 07:31:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:31,855 INFO L475 AbstractCegarLoop]: Abstraction has 795548 states and 1120975 transitions. [2019-09-10 07:31:31,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:31:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 795548 states and 1120975 transitions. [2019-09-10 07:31:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:31:31,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:31,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:31,894 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:31,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1993728643, now seen corresponding path program 1 times [2019-09-10 07:31:31,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:31,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:31,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:31,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:31,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:31,999 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:31:31,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:31:31,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:31:31,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:31:32,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:31:32,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:31:32,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:31:32,000 INFO L87 Difference]: Start difference. First operand 795548 states and 1120975 transitions. Second operand 7 states. [2019-09-10 07:31:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:54,010 INFO L93 Difference]: Finished difference Result 2926830 states and 4097285 transitions. [2019-09-10 07:31:54,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:31:54,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:31:54,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:59,328 INFO L225 Difference]: With dead ends: 2926830 [2019-09-10 07:31:59,328 INFO L226 Difference]: Without dead ends: 2926830 [2019-09-10 07:31:59,329 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:32:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926830 states. [2019-09-10 07:32:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926830 to 795838. [2019-09-10 07:32:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795838 states. [2019-09-10 07:32:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795838 states to 795838 states and 1121323 transitions. [2019-09-10 07:32:39,260 INFO L78 Accepts]: Start accepts. Automaton has 795838 states and 1121323 transitions. Word has length 106 [2019-09-10 07:32:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:32:39,260 INFO L475 AbstractCegarLoop]: Abstraction has 795838 states and 1121323 transitions. [2019-09-10 07:32:39,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:32:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 795838 states and 1121323 transitions. [2019-09-10 07:32:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:32:39,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:32:39,305 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, 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:32:39,305 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:32:39,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:39,305 INFO L82 PathProgramCache]: Analyzing trace with hash 664504472, now seen corresponding path program 1 times [2019-09-10 07:32:39,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:32:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:39,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:39,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:32:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:39,509 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:32:39,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:32:39,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:32:39,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:32:39,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:32:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:32:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:32:39,511 INFO L87 Difference]: Start difference. First operand 795838 states and 1121323 transitions. Second operand 8 states. [2019-09-10 07:33:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:33:06,016 INFO L93 Difference]: Finished difference Result 3488208 states and 4910627 transitions. [2019-09-10 07:33:06,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:33:06,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2019-09-10 07:33:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:33:13,384 INFO L225 Difference]: With dead ends: 3488208 [2019-09-10 07:33:13,384 INFO L226 Difference]: Without dead ends: 3488208 [2019-09-10 07:33:13,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:33:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488208 states. [2019-09-10 07:33:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488208 to 911934. [2019-09-10 07:33:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911934 states. [2019-09-10 07:33:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911934 states to 911934 states and 1285961 transitions. [2019-09-10 07:33:59,390 INFO L78 Accepts]: Start accepts. Automaton has 911934 states and 1285961 transitions. Word has length 108 [2019-09-10 07:33:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:33:59,390 INFO L475 AbstractCegarLoop]: Abstraction has 911934 states and 1285961 transitions. [2019-09-10 07:33:59,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:33:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 911934 states and 1285961 transitions. [2019-09-10 07:34:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:34:10,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:10,250 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, 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:34:10,250 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash 324579015, now seen corresponding path program 1 times [2019-09-10 07:34:10,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:10,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:10,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:10,456 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:34:10,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:10,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:34:10,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:10,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:34:10,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:34:10,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:34:10,460 INFO L87 Difference]: Start difference. First operand 911934 states and 1285961 transitions. Second operand 8 states. [2019-09-10 07:34:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:38,850 INFO L93 Difference]: Finished difference Result 3680574 states and 5186303 transitions. [2019-09-10 07:34:38,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:34:38,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2019-09-10 07:34:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:45,261 INFO L225 Difference]: With dead ends: 3680574 [2019-09-10 07:34:45,261 INFO L226 Difference]: Without dead ends: 3680574 [2019-09-10 07:34:45,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132