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_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:23:01,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:23:01,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:23:01,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:23:01,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:23:01,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:23:01,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:23:01,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:23:01,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:23:01,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:23:01,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:23:01,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:23:01,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:23:01,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:23:01,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:23:01,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:23:01,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:23:01,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:23:01,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:23:01,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:23:01,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:23:01,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:23:01,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:23:01,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:23:01,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:23:01,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:23:01,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:23:01,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:23:01,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:23:01,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:23:01,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:23:01,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:23:01,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:23:01,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:23:01,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:23:01,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:23:01,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:23:01,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:23:01,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:23:01,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:23:01,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:23:01,709 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 06:23:01,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:23:01,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:23:01,725 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:23:01,726 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:23:01,726 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:23:01,727 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:23:01,727 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:23:01,727 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:23:01,727 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:23:01,727 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:23:01,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:23:01,728 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:23:01,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:23:01,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:23:01,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:23:01,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:23:01,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:23:01,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:23:01,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:23:01,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:23:01,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:23:01,732 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:23:01,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:23:01,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:23:01,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:23:01,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:23:01,733 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:23:01,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:23:01,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:23:01,734 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:23:01,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:23:01,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:23:01,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:23:01,791 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:23:01,791 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:23:01,792 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:23:01,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22df2aa29/fe7a47191e904b1aaa153d7c4493b626/FLAGe4ca9a7f7 [2019-09-10 06:23:02,424 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:23:02,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:23:02,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22df2aa29/fe7a47191e904b1aaa153d7c4493b626/FLAGe4ca9a7f7 [2019-09-10 06:23:02,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22df2aa29/fe7a47191e904b1aaa153d7c4493b626 [2019-09-10 06:23:02,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:23:02,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:23:02,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:23:02,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:23:02,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:23:02,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:02" (1/1) ... [2019-09-10 06:23:02,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27370af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:02, skipping insertion in model container [2019-09-10 06:23:02,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:02" (1/1) ... [2019-09-10 06:23:02,760 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:23:02,831 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:23:03,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:23:03,397 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:23:03,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:23:03,567 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:23:03,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03 WrapperNode [2019-09-10 06:23:03,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:23:03,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:23:03,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:23:03,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:23:03,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03" (1/1) ... [2019-09-10 06:23:03,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03" (1/1) ... [2019-09-10 06:23:03,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03" (1/1) ... [2019-09-10 06:23:03,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03" (1/1) ... [2019-09-10 06:23:03,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03" (1/1) ... [2019-09-10 06:23:03,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03" (1/1) ... [2019-09-10 06:23:03,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03" (1/1) ... [2019-09-10 06:23:03,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:23:03,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:23:03,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:23:03,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:23:03,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03" (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 06:23:03,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:23:03,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:23:03,747 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:23:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:23:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:23:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:23:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:23:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:23:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:23:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:23:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:23:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:23:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:23:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:23:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:23:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:23:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:23:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:23:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:23:05,352 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:23:05,354 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:23:05,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:23:05 BoogieIcfgContainer [2019-09-10 06:23:05,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:23:05,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:23:05,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:23:05,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:23:05,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:23:02" (1/3) ... [2019-09-10 06:23:05,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f18101c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:23:05, skipping insertion in model container [2019-09-10 06:23:05,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:03" (2/3) ... [2019-09-10 06:23:05,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f18101c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:23:05, skipping insertion in model container [2019-09-10 06:23:05,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:23:05" (3/3) ... [2019-09-10 06:23:05,369 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:23:05,380 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:23:05,401 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:23:05,418 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:23:05,442 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:23:05,442 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:23:05,442 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:23:05,442 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:23:05,442 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:23:05,443 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:23:05,443 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:23:05,443 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:23:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-09-10 06:23:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:23:05,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:05,491 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:05,493 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:05,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2040025279, now seen corresponding path program 1 times [2019-09-10 06:23:05,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:05,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:05,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:05,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:06,120 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 06:23:06,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:06,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:06,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:06,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:06,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:06,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:06,154 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 3 states. [2019-09-10 06:23:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:06,301 INFO L93 Difference]: Finished difference Result 444 states and 770 transitions. [2019-09-10 06:23:06,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:06,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:23:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:06,321 INFO L225 Difference]: With dead ends: 444 [2019-09-10 06:23:06,321 INFO L226 Difference]: Without dead ends: 436 [2019-09-10 06:23:06,323 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 06:23:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-10 06:23:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-09-10 06:23:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-10 06:23:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 718 transitions. [2019-09-10 06:23:06,416 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 718 transitions. Word has length 115 [2019-09-10 06:23:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:06,417 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 718 transitions. [2019-09-10 06:23:06,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 718 transitions. [2019-09-10 06:23:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:23:06,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:06,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:06,427 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1630734110, now seen corresponding path program 1 times [2019-09-10 06:23:06,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:06,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:06,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:06,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:06,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:06,753 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 06:23:06,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:06,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:06,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:06,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:06,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:06,757 INFO L87 Difference]: Start difference. First operand 434 states and 718 transitions. Second operand 3 states. [2019-09-10 06:23:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:06,799 INFO L93 Difference]: Finished difference Result 537 states and 891 transitions. [2019-09-10 06:23:06,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:06,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 06:23:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:06,807 INFO L225 Difference]: With dead ends: 537 [2019-09-10 06:23:06,808 INFO L226 Difference]: Without dead ends: 537 [2019-09-10 06:23:06,809 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 06:23:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-10 06:23:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-09-10 06:23:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-10 06:23:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 890 transitions. [2019-09-10 06:23:06,844 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 890 transitions. Word has length 118 [2019-09-10 06:23:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:06,845 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 890 transitions. [2019-09-10 06:23:06,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 890 transitions. [2019-09-10 06:23:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:23:06,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:06,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:06,849 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1903519920, now seen corresponding path program 1 times [2019-09-10 06:23:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:06,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:06,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:06,979 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 06:23:06,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:06,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:06,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:06,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:06,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:06,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:06,983 INFO L87 Difference]: Start difference. First operand 535 states and 890 transitions. Second operand 3 states. [2019-09-10 06:23:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:07,018 INFO L93 Difference]: Finished difference Result 848 states and 1411 transitions. [2019-09-10 06:23:07,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:07,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 06:23:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:07,028 INFO L225 Difference]: With dead ends: 848 [2019-09-10 06:23:07,028 INFO L226 Difference]: Without dead ends: 848 [2019-09-10 06:23:07,028 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 06:23:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-09-10 06:23:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2019-09-10 06:23:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-10 06:23:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1410 transitions. [2019-09-10 06:23:07,055 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1410 transitions. Word has length 118 [2019-09-10 06:23:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:07,057 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1410 transitions. [2019-09-10 06:23:07,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1410 transitions. [2019-09-10 06:23:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:23:07,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:07,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:07,066 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1633458995, now seen corresponding path program 1 times [2019-09-10 06:23:07,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:07,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:07,198 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 06:23:07,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:07,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:07,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:07,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:07,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:07,201 INFO L87 Difference]: Start difference. First operand 846 states and 1410 transitions. Second operand 3 states. [2019-09-10 06:23:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:07,234 INFO L93 Difference]: Finished difference Result 1126 states and 1877 transitions. [2019-09-10 06:23:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:07,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 06:23:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:07,243 INFO L225 Difference]: With dead ends: 1126 [2019-09-10 06:23:07,243 INFO L226 Difference]: Without dead ends: 1126 [2019-09-10 06:23:07,244 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 06:23:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-10 06:23:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124. [2019-09-10 06:23:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-09-10 06:23:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1876 transitions. [2019-09-10 06:23:07,279 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1876 transitions. Word has length 121 [2019-09-10 06:23:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:07,280 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1876 transitions. [2019-09-10 06:23:07,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1876 transitions. [2019-09-10 06:23:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:23:07,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:07,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:07,283 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:07,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1760173243, now seen corresponding path program 1 times [2019-09-10 06:23:07,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:07,435 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 06:23:07,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:07,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:07,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:07,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:07,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:07,437 INFO L87 Difference]: Start difference. First operand 1124 states and 1876 transitions. Second operand 3 states. [2019-09-10 06:23:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:07,479 INFO L93 Difference]: Finished difference Result 1954 states and 3248 transitions. [2019-09-10 06:23:07,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:07,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 06:23:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:07,494 INFO L225 Difference]: With dead ends: 1954 [2019-09-10 06:23:07,494 INFO L226 Difference]: Without dead ends: 1954 [2019-09-10 06:23:07,495 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 06:23:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-09-10 06:23:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2019-09-10 06:23:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-10 06:23:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3247 transitions. [2019-09-10 06:23:07,574 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3247 transitions. Word has length 121 [2019-09-10 06:23:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:07,575 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3247 transitions. [2019-09-10 06:23:07,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3247 transitions. [2019-09-10 06:23:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:23:07,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:07,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:07,579 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash -499105252, now seen corresponding path program 1 times [2019-09-10 06:23:07,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:07,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:07,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 06:23:07,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:07,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:07,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:07,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:07,745 INFO L87 Difference]: Start difference. First operand 1952 states and 3247 transitions. Second operand 3 states. [2019-09-10 06:23:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:07,801 INFO L93 Difference]: Finished difference Result 2647 states and 4403 transitions. [2019-09-10 06:23:07,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:07,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 06:23:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:07,821 INFO L225 Difference]: With dead ends: 2647 [2019-09-10 06:23:07,821 INFO L226 Difference]: Without dead ends: 2647 [2019-09-10 06:23:07,822 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 06:23:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-09-10 06:23:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2645. [2019-09-10 06:23:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-09-10 06:23:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4402 transitions. [2019-09-10 06:23:07,925 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4402 transitions. Word has length 124 [2019-09-10 06:23:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:07,926 INFO L475 AbstractCegarLoop]: Abstraction has 2645 states and 4402 transitions. [2019-09-10 06:23:07,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4402 transitions. [2019-09-10 06:23:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:23:07,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:07,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:07,934 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:07,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:07,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1030513194, now seen corresponding path program 1 times [2019-09-10 06:23:07,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:07,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:07,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:08,118 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 06:23:08,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:08,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:08,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:08,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:08,121 INFO L87 Difference]: Start difference. First operand 2645 states and 4402 transitions. Second operand 3 states. [2019-09-10 06:23:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:08,181 INFO L93 Difference]: Finished difference Result 4816 states and 7949 transitions. [2019-09-10 06:23:08,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:08,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 06:23:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:08,212 INFO L225 Difference]: With dead ends: 4816 [2019-09-10 06:23:08,212 INFO L226 Difference]: Without dead ends: 4816 [2019-09-10 06:23:08,213 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 06:23:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-09-10 06:23:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4814. [2019-09-10 06:23:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-09-10 06:23:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 7948 transitions. [2019-09-10 06:23:08,359 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 7948 transitions. Word has length 124 [2019-09-10 06:23:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:08,359 INFO L475 AbstractCegarLoop]: Abstraction has 4814 states and 7948 transitions. [2019-09-10 06:23:08,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 7948 transitions. [2019-09-10 06:23:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 06:23:08,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:08,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:08,363 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:08,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash -577751605, now seen corresponding path program 1 times [2019-09-10 06:23:08,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:08,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:08,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:08,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:08,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:08,605 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 06:23:08,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:08,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:23:08,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:08,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:23:08,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:23:08,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:23:08,607 INFO L87 Difference]: Start difference. First operand 4814 states and 7948 transitions. Second operand 6 states. [2019-09-10 06:23:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:09,189 INFO L93 Difference]: Finished difference Result 24302 states and 40369 transitions. [2019-09-10 06:23:09,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:23:09,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 06:23:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:09,309 INFO L225 Difference]: With dead ends: 24302 [2019-09-10 06:23:09,310 INFO L226 Difference]: Without dead ends: 24302 [2019-09-10 06:23:09,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:23:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24302 states. [2019-09-10 06:23:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24302 to 9308. [2019-09-10 06:23:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9308 states. [2019-09-10 06:23:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 15301 transitions. [2019-09-10 06:23:09,799 INFO L78 Accepts]: Start accepts. Automaton has 9308 states and 15301 transitions. Word has length 127 [2019-09-10 06:23:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:09,799 INFO L475 AbstractCegarLoop]: Abstraction has 9308 states and 15301 transitions. [2019-09-10 06:23:09,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:23:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 9308 states and 15301 transitions. [2019-09-10 06:23:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:23:09,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:09,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:09,802 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:09,802 INFO L82 PathProgramCache]: Analyzing trace with hash -796598874, now seen corresponding path program 1 times [2019-09-10 06:23:09,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:09,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:09,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:09,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:09,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:09,974 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 06:23:09,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:09,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:09,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:09,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:09,976 INFO L87 Difference]: Start difference. First operand 9308 states and 15301 transitions. Second operand 4 states. [2019-09-10 06:23:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:10,214 INFO L93 Difference]: Finished difference Result 18232 states and 30131 transitions. [2019-09-10 06:23:10,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:10,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 06:23:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:10,273 INFO L225 Difference]: With dead ends: 18232 [2019-09-10 06:23:10,273 INFO L226 Difference]: Without dead ends: 18232 [2019-09-10 06:23:10,274 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 06:23:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18232 states. [2019-09-10 06:23:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18232 to 15163. [2019-09-10 06:23:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-10 06:23:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 24965 transitions. [2019-09-10 06:23:10,700 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 24965 transitions. Word has length 128 [2019-09-10 06:23:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:10,701 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 24965 transitions. [2019-09-10 06:23:10,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 24965 transitions. [2019-09-10 06:23:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:23:10,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:10,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:10,703 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:10,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash 584578538, now seen corresponding path program 1 times [2019-09-10 06:23:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:10,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:10,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:10,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:10,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:10,824 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 06:23:10,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:10,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:10,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:10,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:10,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:10,831 INFO L87 Difference]: Start difference. First operand 15163 states and 24965 transitions. Second operand 3 states. [2019-09-10 06:23:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:10,967 INFO L93 Difference]: Finished difference Result 20841 states and 34254 transitions. [2019-09-10 06:23:10,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:10,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 06:23:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:11,020 INFO L225 Difference]: With dead ends: 20841 [2019-09-10 06:23:11,020 INFO L226 Difference]: Without dead ends: 20841 [2019-09-10 06:23:11,021 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 06:23:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20841 states. [2019-09-10 06:23:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20841 to 20839. [2019-09-10 06:23:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20839 states. [2019-09-10 06:23:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20839 states to 20839 states and 34253 transitions. [2019-09-10 06:23:11,550 INFO L78 Accepts]: Start accepts. Automaton has 20839 states and 34253 transitions. Word has length 128 [2019-09-10 06:23:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:11,551 INFO L475 AbstractCegarLoop]: Abstraction has 20839 states and 34253 transitions. [2019-09-10 06:23:11,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 20839 states and 34253 transitions. [2019-09-10 06:23:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:23:11,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:11,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:11,553 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:11,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:11,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1013628402, now seen corresponding path program 1 times [2019-09-10 06:23:11,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:11,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:11,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:11,677 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 06:23:11,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:11,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:11,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:11,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:11,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:11,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:11,679 INFO L87 Difference]: Start difference. First operand 20839 states and 34253 transitions. Second operand 4 states. [2019-09-10 06:23:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:11,981 INFO L93 Difference]: Finished difference Result 40351 states and 66359 transitions. [2019-09-10 06:23:11,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:11,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 06:23:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:12,112 INFO L225 Difference]: With dead ends: 40351 [2019-09-10 06:23:12,113 INFO L226 Difference]: Without dead ends: 40351 [2019-09-10 06:23:12,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-10 06:23:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 33920. [2019-09-10 06:23:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33920 states. [2019-09-10 06:23:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33920 states to 33920 states and 55603 transitions. [2019-09-10 06:23:13,742 INFO L78 Accepts]: Start accepts. Automaton has 33920 states and 55603 transitions. Word has length 129 [2019-09-10 06:23:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:13,744 INFO L475 AbstractCegarLoop]: Abstraction has 33920 states and 55603 transitions. [2019-09-10 06:23:13,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 33920 states and 55603 transitions. [2019-09-10 06:23:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 06:23:13,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:13,748 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, 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 06:23:13,748 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1300657133, now seen corresponding path program 1 times [2019-09-10 06:23:13,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:13,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:13,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:13,926 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 06:23:13,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:13,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:13,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:13,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:13,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:13,930 INFO L87 Difference]: Start difference. First operand 33920 states and 55603 transitions. Second operand 4 states. [2019-09-10 06:23:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:14,429 INFO L93 Difference]: Finished difference Result 64914 states and 106473 transitions. [2019-09-10 06:23:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:14,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 06:23:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:14,615 INFO L225 Difference]: With dead ends: 64914 [2019-09-10 06:23:14,616 INFO L226 Difference]: Without dead ends: 64914 [2019-09-10 06:23:14,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64914 states. [2019-09-10 06:23:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64914 to 54909. [2019-09-10 06:23:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54909 states. [2019-09-10 06:23:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54909 states to 54909 states and 89761 transitions. [2019-09-10 06:23:16,490 INFO L78 Accepts]: Start accepts. Automaton has 54909 states and 89761 transitions. Word has length 130 [2019-09-10 06:23:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:16,490 INFO L475 AbstractCegarLoop]: Abstraction has 54909 states and 89761 transitions. [2019-09-10 06:23:16,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54909 states and 89761 transitions. [2019-09-10 06:23:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 06:23:16,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:16,492 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, 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 06:23:16,492 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:16,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1613171225, now seen corresponding path program 1 times [2019-09-10 06:23:16,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:16,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:16,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:16,649 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 06:23:16,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:16,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:23:16,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:16,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:23:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:23:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:23:16,651 INFO L87 Difference]: Start difference. First operand 54909 states and 89761 transitions. Second operand 7 states. [2019-09-10 06:23:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:19,187 INFO L93 Difference]: Finished difference Result 212252 states and 346491 transitions. [2019-09-10 06:23:19,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:23:19,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-10 06:23:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:19,776 INFO L225 Difference]: With dead ends: 212252 [2019-09-10 06:23:19,776 INFO L226 Difference]: Without dead ends: 212252 [2019-09-10 06:23:19,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:23:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212252 states. [2019-09-10 06:23:22,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212252 to 148492. [2019-09-10 06:23:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-10 06:23:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 241054 transitions. [2019-09-10 06:23:22,350 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 241054 transitions. Word has length 131 [2019-09-10 06:23:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:22,350 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 241054 transitions. [2019-09-10 06:23:22,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:23:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 241054 transitions. [2019-09-10 06:23:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 06:23:22,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:22,352 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, 1, 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 06:23:22,352 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1715276375, now seen corresponding path program 1 times [2019-09-10 06:23:22,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:22,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:22,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:22,669 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 06:23:22,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:22,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:23:22,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:22,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:23:22,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:23:22,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:23:22,672 INFO L87 Difference]: Start difference. First operand 148492 states and 241054 transitions. Second operand 6 states. [2019-09-10 06:23:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:25,725 INFO L93 Difference]: Finished difference Result 205422 states and 333953 transitions. [2019-09-10 06:23:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:23:25,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-10 06:23:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:26,317 INFO L225 Difference]: With dead ends: 205422 [2019-09-10 06:23:26,317 INFO L226 Difference]: Without dead ends: 205422 [2019-09-10 06:23:26,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:23:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205422 states. [2019-09-10 06:23:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205422 to 148492. [2019-09-10 06:23:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-10 06:23:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 240429 transitions. [2019-09-10 06:23:28,770 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 240429 transitions. Word has length 133 [2019-09-10 06:23:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:28,771 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 240429 transitions. [2019-09-10 06:23:28,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:23:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 240429 transitions. [2019-09-10 06:23:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 06:23:28,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:28,773 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, 1, 1, 1, 1, 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 06:23:28,773 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:28,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:28,774 INFO L82 PathProgramCache]: Analyzing trace with hash -326924610, now seen corresponding path program 1 times [2019-09-10 06:23:28,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:28,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:28,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:29,016 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 06:23:29,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:29,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:23:29,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:29,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:23:29,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:23:29,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:23:29,018 INFO L87 Difference]: Start difference. First operand 148492 states and 240429 transitions. Second operand 6 states. [2019-09-10 06:23:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:33,177 INFO L93 Difference]: Finished difference Result 287801 states and 465957 transitions. [2019-09-10 06:23:33,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:23:33,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-10 06:23:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:33,674 INFO L225 Difference]: With dead ends: 287801 [2019-09-10 06:23:33,674 INFO L226 Difference]: Without dead ends: 287801 [2019-09-10 06:23:33,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:23:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287801 states. [2019-09-10 06:23:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287801 to 287797. [2019-09-10 06:23:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287797 states. [2019-09-10 06:23:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287797 states to 287797 states and 465955 transitions. [2019-09-10 06:23:36,836 INFO L78 Accepts]: Start accepts. Automaton has 287797 states and 465955 transitions. Word has length 136 [2019-09-10 06:23:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:36,836 INFO L475 AbstractCegarLoop]: Abstraction has 287797 states and 465955 transitions. [2019-09-10 06:23:36,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:23:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 287797 states and 465955 transitions. [2019-09-10 06:23:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 06:23:36,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:36,837 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, 1, 1, 1, 1, 1, 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 06:23:36,838 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:36,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1546637434, now seen corresponding path program 1 times [2019-09-10 06:23:36,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:36,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:36,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:36,984 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 06:23:36,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:36,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:23:36,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:36,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:23:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:23:36,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:36,988 INFO L87 Difference]: Start difference. First operand 287797 states and 465955 transitions. Second operand 5 states. [2019-09-10 06:23:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:41,899 INFO L93 Difference]: Finished difference Result 473703 states and 760804 transitions. [2019-09-10 06:23:41,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:23:41,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-10 06:23:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:42,769 INFO L225 Difference]: With dead ends: 473703 [2019-09-10 06:23:42,770 INFO L226 Difference]: Without dead ends: 473703 [2019-09-10 06:23:42,770 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 06:23:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473703 states. [2019-09-10 06:23:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473703 to 292397. [2019-09-10 06:23:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292397 states. [2019-09-10 06:23:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292397 states to 292397 states and 470510 transitions. [2019-09-10 06:23:51,706 INFO L78 Accepts]: Start accepts. Automaton has 292397 states and 470510 transitions. Word has length 137 [2019-09-10 06:23:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:51,706 INFO L475 AbstractCegarLoop]: Abstraction has 292397 states and 470510 transitions. [2019-09-10 06:23:51,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:23:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 292397 states and 470510 transitions. [2019-09-10 06:23:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:23:51,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:51,717 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:51,717 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:51,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2041446640, now seen corresponding path program 1 times [2019-09-10 06:23:51,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:51,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:51,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:51,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:23:51,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:23:51,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2019-09-10 06:23:51,895 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [253], [256], [280], [283], [285], [289], [318], [322], [351], [386], [389], [392], [395], [398], [401], [408], [416], [418], [421], [422], [424], [433], [436], [447], [450], [462], [480], [483], [520], [528], [536], [544], [550], [554], [558], [562], [564], [567], [604], [612], [620], [628], [634], [638], [642], [646], [648], [651], [688], [696], [704], [712], [722], [726], [730], [732], [735], [772], [780], [788], [796], [1421], [1422], [1426], [1427], [1428] [2019-09-10 06:23:51,970 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:23:51,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:23:52,199 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:23:52,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:23:52,765 INFO L272 AbstractInterpreter]: Visited 155 different actions 436 times. Merged at 55 different actions 257 times. Widened at 11 different actions 15 times. Performed 1572 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1572 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 5 different actions. Largest state had 281 variables. [2019-09-10 06:23:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:52,771 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:23:54,705 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 87.58% of their original sizes. [2019-09-10 06:23:54,705 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:24:32,271 INFO L420 sIntCurrentIteration]: We unified 166 AI predicates to 166 [2019-09-10 06:24:32,271 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:24:32,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:24:32,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [114] imperfect sequences [5] total 117 [2019-09-10 06:24:32,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:32,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-10 06:24:32,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-10 06:24:32,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1689, Invalid=11193, Unknown=0, NotChecked=0, Total=12882 [2019-09-10 06:24:32,279 INFO L87 Difference]: Start difference. First operand 292397 states and 470510 transitions. Second operand 114 states. [2019-09-10 06:29:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:16,277 INFO L93 Difference]: Finished difference Result 1405457 states and 2209778 transitions. [2019-09-10 06:29:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-10 06:29:16,277 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 167 [2019-09-10 06:29:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:20,475 INFO L225 Difference]: With dead ends: 1405457 [2019-09-10 06:29:20,475 INFO L226 Difference]: Without dead ends: 1405457 [2019-09-10 06:29:20,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16201 ImplicationChecksByTransitivity, 51.7s TimeCoverageRelationStatistics Valid=5828, Invalid=41478, Unknown=0, NotChecked=0, Total=47306 [2019-09-10 06:29:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405457 states. [2019-09-10 06:29:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405457 to 498976. [2019-09-10 06:29:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498976 states. [2019-09-10 06:29:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498976 states to 498976 states and 800298 transitions. [2019-09-10 06:29:42,784 INFO L78 Accepts]: Start accepts. Automaton has 498976 states and 800298 transitions. Word has length 167 [2019-09-10 06:29:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:42,784 INFO L475 AbstractCegarLoop]: Abstraction has 498976 states and 800298 transitions. [2019-09-10 06:29:42,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-10 06:29:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 498976 states and 800298 transitions. [2019-09-10 06:29:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:29:42,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:42,806 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:42,806 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1226993252, now seen corresponding path program 1 times [2019-09-10 06:29:42,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:42,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:42,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:42,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:29:49,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:49,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:49,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:49,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:49,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:49,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:49,977 INFO L87 Difference]: Start difference. First operand 498976 states and 800298 transitions. Second operand 4 states. [2019-09-10 06:29:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:52,780 INFO L93 Difference]: Finished difference Result 791377 states and 1272215 transitions. [2019-09-10 06:29:52,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:29:52,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-10 06:29:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:55,426 INFO L225 Difference]: With dead ends: 791377 [2019-09-10 06:29:55,427 INFO L226 Difference]: Without dead ends: 791377 [2019-09-10 06:29:55,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791377 states. [2019-09-10 06:30:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791377 to 701977. [2019-09-10 06:30:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701977 states. [2019-09-10 06:30:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701977 states to 701977 states and 1129209 transitions. [2019-09-10 06:30:22,397 INFO L78 Accepts]: Start accepts. Automaton has 701977 states and 1129209 transitions. Word has length 167 [2019-09-10 06:30:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:22,397 INFO L475 AbstractCegarLoop]: Abstraction has 701977 states and 1129209 transitions. [2019-09-10 06:30:22,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 701977 states and 1129209 transitions. [2019-09-10 06:30:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:30:22,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:22,408 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:30:22,409 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash -452129158, now seen corresponding path program 1 times [2019-09-10 06:30:22,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:22,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:22,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:22,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:22,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:30:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:22,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:30:22,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:22,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:30:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:30:22,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:30:22,601 INFO L87 Difference]: Start difference. First operand 701977 states and 1129209 transitions. Second operand 6 states. [2019-09-10 06:30:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:27,451 INFO L93 Difference]: Finished difference Result 869972 states and 1402219 transitions. [2019-09-10 06:30:27,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:30:27,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:30:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:39,914 INFO L225 Difference]: With dead ends: 869972 [2019-09-10 06:30:39,915 INFO L226 Difference]: Without dead ends: 869972 [2019-09-10 06:30:39,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:30:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869972 states. [2019-09-10 06:30:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869972 to 788654. [2019-09-10 06:30:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788654 states. [2019-09-10 06:31:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788654 states to 788654 states and 1268977 transitions. [2019-09-10 06:31:04,029 INFO L78 Accepts]: Start accepts. Automaton has 788654 states and 1268977 transitions. Word has length 167 [2019-09-10 06:31:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:04,029 INFO L475 AbstractCegarLoop]: Abstraction has 788654 states and 1268977 transitions. [2019-09-10 06:31:04,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:31:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 788654 states and 1268977 transitions. [2019-09-10 06:31:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:31:04,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:04,039 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:31:04,039 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1361288056, now seen corresponding path program 1 times [2019-09-10 06:31:04,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:04,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:04,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:31:04,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:04,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:31:04,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:04,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:31:04,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:31:04,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:31:04,237 INFO L87 Difference]: Start difference. First operand 788654 states and 1268977 transitions. Second operand 6 states. [2019-09-10 06:31:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:15,506 INFO L93 Difference]: Finished difference Result 1032170 states and 1667585 transitions. [2019-09-10 06:31:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:31:15,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:31:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:18,010 INFO L225 Difference]: With dead ends: 1032170 [2019-09-10 06:31:18,010 INFO L226 Difference]: Without dead ends: 1032170 [2019-09-10 06:31:18,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:31:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032170 states. [2019-09-10 06:31:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032170 to 836466. [2019-09-10 06:31:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836466 states. [2019-09-10 06:31:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836466 states to 836466 states and 1346712 transitions. [2019-09-10 06:31:52,358 INFO L78 Accepts]: Start accepts. Automaton has 836466 states and 1346712 transitions. Word has length 167 [2019-09-10 06:31:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:52,358 INFO L475 AbstractCegarLoop]: Abstraction has 836466 states and 1346712 transitions. [2019-09-10 06:31:52,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:31:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 836466 states and 1346712 transitions. [2019-09-10 06:31:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:31:52,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:52,365 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:31:52,366 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash -224812315, now seen corresponding path program 1 times [2019-09-10 06:31:52,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:52,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:52,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:52,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:52,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:31:52,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:52,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:31:52,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:52,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:31:52,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:31:52,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:31:52,504 INFO L87 Difference]: Start difference. First operand 836466 states and 1346712 transitions. Second operand 3 states. [2019-09-10 06:32:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:10,073 INFO L93 Difference]: Finished difference Result 1613355 states and 2586503 transitions. [2019-09-10 06:32:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:10,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 06:32:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:13,446 INFO L225 Difference]: With dead ends: 1613355 [2019-09-10 06:32:13,446 INFO L226 Difference]: Without dead ends: 1613355 [2019-09-10 06:32:13,447 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 06:32:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613355 states. [2019-09-10 06:32:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613355 to 1613353. [2019-09-10 06:32:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613353 states.