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_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:52:08,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:52:08,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:52:08,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:52:08,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:52:08,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:52:08,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:52:08,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:52:08,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:52:08,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:52:08,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:52:08,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:52:08,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:52:08,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:52:08,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:52:08,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:52:08,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:52:08,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:52:08,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:52:08,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:52:08,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:52:08,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:52:08,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:52:08,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:52:08,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:52:08,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:52:08,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:52:08,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:52:08,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:52:08,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:52:08,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:52:08,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:52:08,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:52:08,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:52:08,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:52:08,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:52:08,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:52:08,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:52:08,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:52:08,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:52:08,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:52:08,654 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 08:52:08,669 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:52:08,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:52:08,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:52:08,670 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:52:08,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:52:08,670 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:52:08,671 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:52:08,671 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:52:08,671 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:52:08,671 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:52:08,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:52:08,672 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:52:08,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:52:08,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:52:08,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:52:08,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:52:08,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:52:08,673 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:52:08,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:52:08,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:52:08,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:52:08,674 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:52:08,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:52:08,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:52:08,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:52:08,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:52:08,675 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:52:08,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:52:08,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:52:08,676 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:52:08,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:52:08,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:52:08,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:52:08,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:52:08,722 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:52:08,722 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:52:08,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e7d86fe/c437acae6a2a4c97b8027fa2facce21a/FLAG640b0a6be [2019-09-10 08:52:09,415 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:52:09,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:52:09,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e7d86fe/c437acae6a2a4c97b8027fa2facce21a/FLAG640b0a6be [2019-09-10 08:52:09,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e7d86fe/c437acae6a2a4c97b8027fa2facce21a [2019-09-10 08:52:09,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:52:09,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:52:09,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:52:09,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:52:09,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:52:09,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:52:09" (1/1) ... [2019-09-10 08:52:09,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7f1b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:09, skipping insertion in model container [2019-09-10 08:52:09,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:52:09" (1/1) ... [2019-09-10 08:52:09,717 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:52:09,796 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:52:10,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:52:10,335 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:52:10,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:52:10,727 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:52:10,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10 WrapperNode [2019-09-10 08:52:10,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:52:10,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:52:10,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:52:10,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:52:10,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10" (1/1) ... [2019-09-10 08:52:10,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10" (1/1) ... [2019-09-10 08:52:10,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10" (1/1) ... [2019-09-10 08:52:10,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10" (1/1) ... [2019-09-10 08:52:10,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10" (1/1) ... [2019-09-10 08:52:10,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10" (1/1) ... [2019-09-10 08:52:10,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10" (1/1) ... [2019-09-10 08:52:10,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:52:10,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:52:10,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:52:10,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:52:10,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10" (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 08:52:10,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:52:10,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:52:10,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:52:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:52:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:52:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:52:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:52:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:52:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:52:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:52:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:52:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:52:10,956 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:52:10,957 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:52:10,957 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:52:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:52:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:52:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:52:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:52:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:52:12,517 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:52:12,518 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:52:12,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:52:12 BoogieIcfgContainer [2019-09-10 08:52:12,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:52:12,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:52:12,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:52:12,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:52:12,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:52:09" (1/3) ... [2019-09-10 08:52:12,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb7ff6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:52:12, skipping insertion in model container [2019-09-10 08:52:12,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:10" (2/3) ... [2019-09-10 08:52:12,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb7ff6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:52:12, skipping insertion in model container [2019-09-10 08:52:12,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:52:12" (3/3) ... [2019-09-10 08:52:12,528 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:52:12,537 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:52:12,545 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:52:12,561 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:52:12,587 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:52:12,587 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:52:12,587 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:52:12,587 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:52:12,587 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:52:12,588 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:52:12,588 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:52:12,588 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:52:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states. [2019-09-10 08:52:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:52:12,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:12,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:12,637 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash -173501281, now seen corresponding path program 1 times [2019-09-10 08:52:12,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:12,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:12,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:13,251 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 08:52:13,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:13,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:13,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:13,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:13,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:13,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:13,278 INFO L87 Difference]: Start difference. First operand 355 states. Second operand 3 states. [2019-09-10 08:52:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:13,431 INFO L93 Difference]: Finished difference Result 501 states and 860 transitions. [2019-09-10 08:52:13,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:13,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:52:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:13,452 INFO L225 Difference]: With dead ends: 501 [2019-09-10 08:52:13,452 INFO L226 Difference]: Without dead ends: 493 [2019-09-10 08:52:13,454 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 08:52:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-10 08:52:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2019-09-10 08:52:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 08:52:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 805 transitions. [2019-09-10 08:52:13,584 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 805 transitions. Word has length 122 [2019-09-10 08:52:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:13,585 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 805 transitions. [2019-09-10 08:52:13,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 805 transitions. [2019-09-10 08:52:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:52:13,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:13,591 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] [2019-09-10 08:52:13,591 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash -911022634, now seen corresponding path program 1 times [2019-09-10 08:52:13,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:13,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:13,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:13,865 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 08:52:13,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:13,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:13,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:13,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:13,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:13,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:13,870 INFO L87 Difference]: Start difference. First operand 490 states and 805 transitions. Second operand 3 states. [2019-09-10 08:52:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:13,917 INFO L93 Difference]: Finished difference Result 763 states and 1253 transitions. [2019-09-10 08:52:13,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:13,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:52:13,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:13,925 INFO L225 Difference]: With dead ends: 763 [2019-09-10 08:52:13,926 INFO L226 Difference]: Without dead ends: 763 [2019-09-10 08:52:13,927 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 08:52:13,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-09-10 08:52:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759. [2019-09-10 08:52:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-10 08:52:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1250 transitions. [2019-09-10 08:52:13,957 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1250 transitions. Word has length 125 [2019-09-10 08:52:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:13,958 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1250 transitions. [2019-09-10 08:52:13,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1250 transitions. [2019-09-10 08:52:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:52:13,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:13,964 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 08:52:13,964 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash -462854808, now seen corresponding path program 1 times [2019-09-10 08:52:13,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:13,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:13,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:13,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:13,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:14,182 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 08:52:14,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:14,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:14,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:14,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:14,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:14,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:14,188 INFO L87 Difference]: Start difference. First operand 759 states and 1250 transitions. Second operand 3 states. [2019-09-10 08:52:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:14,237 INFO L93 Difference]: Finished difference Result 1281 states and 2103 transitions. [2019-09-10 08:52:14,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:14,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 08:52:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:14,248 INFO L225 Difference]: With dead ends: 1281 [2019-09-10 08:52:14,249 INFO L226 Difference]: Without dead ends: 1281 [2019-09-10 08:52:14,249 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 08:52:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-10 08:52:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1275. [2019-09-10 08:52:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-09-10 08:52:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2098 transitions. [2019-09-10 08:52:14,283 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2098 transitions. Word has length 128 [2019-09-10 08:52:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:14,285 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 2098 transitions. [2019-09-10 08:52:14,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2098 transitions. [2019-09-10 08:52:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:52:14,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:14,289 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 08:52:14,289 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash 750481413, now seen corresponding path program 1 times [2019-09-10 08:52:14,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:14,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:14,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:14,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:14,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:14,474 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 08:52:14,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:14,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:14,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:14,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:14,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:14,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:14,477 INFO L87 Difference]: Start difference. First operand 1275 states and 2098 transitions. Second operand 3 states. [2019-09-10 08:52:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:14,521 INFO L93 Difference]: Finished difference Result 2273 states and 3719 transitions. [2019-09-10 08:52:14,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:14,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 08:52:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:14,537 INFO L225 Difference]: With dead ends: 2273 [2019-09-10 08:52:14,538 INFO L226 Difference]: Without dead ends: 2273 [2019-09-10 08:52:14,538 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 08:52:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-09-10 08:52:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2263. [2019-09-10 08:52:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-09-10 08:52:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3710 transitions. [2019-09-10 08:52:14,608 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3710 transitions. Word has length 131 [2019-09-10 08:52:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:14,609 INFO L475 AbstractCegarLoop]: Abstraction has 2263 states and 3710 transitions. [2019-09-10 08:52:14,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3710 transitions. [2019-09-10 08:52:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:52:14,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:14,612 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] [2019-09-10 08:52:14,612 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:14,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:14,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2145185539, now seen corresponding path program 1 times [2019-09-10 08:52:14,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:14,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:14,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:14,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:14,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:14,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:14,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:52:14,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:14,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:52:14,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:52:14,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:52:14,905 INFO L87 Difference]: Start difference. First operand 2263 states and 3710 transitions. Second operand 6 states. [2019-09-10 08:52:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:15,231 INFO L93 Difference]: Finished difference Result 6567 states and 10822 transitions. [2019-09-10 08:52:15,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:52:15,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 08:52:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:15,266 INFO L225 Difference]: With dead ends: 6567 [2019-09-10 08:52:15,266 INFO L226 Difference]: Without dead ends: 6567 [2019-09-10 08:52:15,267 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 08:52:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6567 states. [2019-09-10 08:52:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6567 to 5164. [2019-09-10 08:52:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-09-10 08:52:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8485 transitions. [2019-09-10 08:52:15,427 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8485 transitions. Word has length 134 [2019-09-10 08:52:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:15,428 INFO L475 AbstractCegarLoop]: Abstraction has 5164 states and 8485 transitions. [2019-09-10 08:52:15,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:52:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8485 transitions. [2019-09-10 08:52:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:52:15,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:15,432 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] [2019-09-10 08:52:15,432 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:15,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2142410535, now seen corresponding path program 1 times [2019-09-10 08:52:15,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:15,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:15,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:15,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:15,634 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 08:52:15,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:15,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:15,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:15,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:15,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:15,637 INFO L87 Difference]: Start difference. First operand 5164 states and 8485 transitions. Second operand 4 states. [2019-09-10 08:52:15,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:15,797 INFO L93 Difference]: Finished difference Result 8735 states and 14408 transitions. [2019-09-10 08:52:15,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:15,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 08:52:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:15,851 INFO L225 Difference]: With dead ends: 8735 [2019-09-10 08:52:15,852 INFO L226 Difference]: Without dead ends: 8735 [2019-09-10 08:52:15,852 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 08:52:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-09-10 08:52:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7629. [2019-09-10 08:52:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7629 states. [2019-09-10 08:52:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 12558 transitions. [2019-09-10 08:52:16,220 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 12558 transitions. Word has length 135 [2019-09-10 08:52:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:16,221 INFO L475 AbstractCegarLoop]: Abstraction has 7629 states and 12558 transitions. [2019-09-10 08:52:16,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 12558 transitions. [2019-09-10 08:52:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:52:16,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:16,232 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 08:52:16,233 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:16,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:16,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2051827388, now seen corresponding path program 1 times [2019-09-10 08:52:16,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:16,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:16,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:16,434 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 08:52:16,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:16,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:16,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:16,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:16,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:16,436 INFO L87 Difference]: Start difference. First operand 7629 states and 12558 transitions. Second operand 4 states. [2019-09-10 08:52:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:16,579 INFO L93 Difference]: Finished difference Result 12870 states and 21193 transitions. [2019-09-10 08:52:16,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:16,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 08:52:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:16,624 INFO L225 Difference]: With dead ends: 12870 [2019-09-10 08:52:16,624 INFO L226 Difference]: Without dead ends: 12870 [2019-09-10 08:52:16,625 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 08:52:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12870 states. [2019-09-10 08:52:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12870 to 11204. [2019-09-10 08:52:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11204 states. [2019-09-10 08:52:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11204 states to 11204 states and 18427 transitions. [2019-09-10 08:52:16,883 INFO L78 Accepts]: Start accepts. Automaton has 11204 states and 18427 transitions. Word has length 136 [2019-09-10 08:52:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:16,884 INFO L475 AbstractCegarLoop]: Abstraction has 11204 states and 18427 transitions. [2019-09-10 08:52:16,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 11204 states and 18427 transitions. [2019-09-10 08:52:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:52:16,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:16,892 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 08:52:16,892 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:16,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:16,893 INFO L82 PathProgramCache]: Analyzing trace with hash 760808192, now seen corresponding path program 1 times [2019-09-10 08:52:16,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:16,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:16,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:16,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:16,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:17,178 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 08:52:17,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:17,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:52:17,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:17,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:52:17,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:52:17,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:52:17,181 INFO L87 Difference]: Start difference. First operand 11204 states and 18427 transitions. Second operand 7 states. [2019-09-10 08:52:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:17,803 INFO L93 Difference]: Finished difference Result 41333 states and 67854 transitions. [2019-09-10 08:52:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:52:17,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-10 08:52:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:17,906 INFO L225 Difference]: With dead ends: 41333 [2019-09-10 08:52:17,906 INFO L226 Difference]: Without dead ends: 41333 [2019-09-10 08:52:17,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:52:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41333 states. [2019-09-10 08:52:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41333 to 32212. [2019-09-10 08:52:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32212 states. [2019-09-10 08:52:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32212 states to 32212 states and 52804 transitions. [2019-09-10 08:52:19,189 INFO L78 Accepts]: Start accepts. Automaton has 32212 states and 52804 transitions. Word has length 137 [2019-09-10 08:52:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:19,189 INFO L475 AbstractCegarLoop]: Abstraction has 32212 states and 52804 transitions. [2019-09-10 08:52:19,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:52:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 32212 states and 52804 transitions. [2019-09-10 08:52:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:52:19,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:19,196 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, 1] [2019-09-10 08:52:19,197 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:19,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:19,197 INFO L82 PathProgramCache]: Analyzing trace with hash 547273736, now seen corresponding path program 1 times [2019-09-10 08:52:19,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:19,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:19,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:19,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:19,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:19,302 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 08:52:19,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:19,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:19,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:19,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:19,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:19,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:19,304 INFO L87 Difference]: Start difference. First operand 32212 states and 52804 transitions. Second operand 3 states. [2019-09-10 08:52:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:19,619 INFO L93 Difference]: Finished difference Result 47784 states and 78035 transitions. [2019-09-10 08:52:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:19,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:52:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:19,710 INFO L225 Difference]: With dead ends: 47784 [2019-09-10 08:52:19,710 INFO L226 Difference]: Without dead ends: 47784 [2019-09-10 08:52:19,711 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 08:52:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47784 states. [2019-09-10 08:52:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47784 to 47782. [2019-09-10 08:52:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47782 states. [2019-09-10 08:52:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47782 states to 47782 states and 78034 transitions. [2019-09-10 08:52:21,679 INFO L78 Accepts]: Start accepts. Automaton has 47782 states and 78034 transitions. Word has length 138 [2019-09-10 08:52:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:21,679 INFO L475 AbstractCegarLoop]: Abstraction has 47782 states and 78034 transitions. [2019-09-10 08:52:21,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 47782 states and 78034 transitions. [2019-09-10 08:52:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:52:21,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:21,684 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, 1] [2019-09-10 08:52:21,684 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:21,684 INFO L82 PathProgramCache]: Analyzing trace with hash 696050988, now seen corresponding path program 1 times [2019-09-10 08:52:21,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:21,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:21,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:21,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:21,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:21,795 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 08:52:21,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:21,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:21,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:21,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:21,798 INFO L87 Difference]: Start difference. First operand 47782 states and 78034 transitions. Second operand 3 states. [2019-09-10 08:52:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:22,069 INFO L93 Difference]: Finished difference Result 68203 states and 111032 transitions. [2019-09-10 08:52:22,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:22,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:52:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:22,218 INFO L225 Difference]: With dead ends: 68203 [2019-09-10 08:52:22,218 INFO L226 Difference]: Without dead ends: 68203 [2019-09-10 08:52:22,219 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 08:52:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-09-10 08:52:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 68201. [2019-09-10 08:52:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68201 states. [2019-09-10 08:52:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68201 states to 68201 states and 111031 transitions. [2019-09-10 08:52:23,425 INFO L78 Accepts]: Start accepts. Automaton has 68201 states and 111031 transitions. Word has length 138 [2019-09-10 08:52:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:23,426 INFO L475 AbstractCegarLoop]: Abstraction has 68201 states and 111031 transitions. [2019-09-10 08:52:23,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 68201 states and 111031 transitions. [2019-09-10 08:52:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:52:23,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:23,433 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, 1] [2019-09-10 08:52:23,433 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2057723275, now seen corresponding path program 1 times [2019-09-10 08:52:23,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:23,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:23,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:23,612 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 08:52:23,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:23,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:23,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:23,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:23,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:23,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:23,615 INFO L87 Difference]: Start difference. First operand 68201 states and 111031 transitions. Second operand 4 states. [2019-09-10 08:52:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:24,777 INFO L93 Difference]: Finished difference Result 133397 states and 217120 transitions. [2019-09-10 08:52:24,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:24,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 08:52:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:24,998 INFO L225 Difference]: With dead ends: 133397 [2019-09-10 08:52:24,998 INFO L226 Difference]: Without dead ends: 133397 [2019-09-10 08:52:25,000 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 08:52:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133397 states. [2019-09-10 08:52:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133397 to 100647. [2019-09-10 08:52:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100647 states. [2019-09-10 08:52:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100647 states to 100647 states and 163638 transitions. [2019-09-10 08:52:27,975 INFO L78 Accepts]: Start accepts. Automaton has 100647 states and 163638 transitions. Word has length 138 [2019-09-10 08:52:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:27,975 INFO L475 AbstractCegarLoop]: Abstraction has 100647 states and 163638 transitions. [2019-09-10 08:52:27,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 100647 states and 163638 transitions. [2019-09-10 08:52:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:52:27,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:27,979 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, 1] [2019-09-10 08:52:27,980 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1977095112, now seen corresponding path program 1 times [2019-09-10 08:52:27,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:27,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:27,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:28,083 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 08:52:28,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:28,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:28,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:28,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:28,086 INFO L87 Difference]: Start difference. First operand 100647 states and 163638 transitions. Second operand 3 states. [2019-09-10 08:52:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:29,049 INFO L93 Difference]: Finished difference Result 148819 states and 240984 transitions. [2019-09-10 08:52:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:29,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:52:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:29,285 INFO L225 Difference]: With dead ends: 148819 [2019-09-10 08:52:29,286 INFO L226 Difference]: Without dead ends: 148819 [2019-09-10 08:52:29,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148819 states. [2019-09-10 08:52:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148819 to 148817. [2019-09-10 08:52:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148817 states. [2019-09-10 08:52:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148817 states to 148817 states and 240983 transitions. [2019-09-10 08:52:32,710 INFO L78 Accepts]: Start accepts. Automaton has 148817 states and 240983 transitions. Word has length 138 [2019-09-10 08:52:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:32,710 INFO L475 AbstractCegarLoop]: Abstraction has 148817 states and 240983 transitions. [2019-09-10 08:52:32,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 148817 states and 240983 transitions. [2019-09-10 08:52:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:52:32,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:32,712 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, 1] [2019-09-10 08:52:32,712 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -682116612, now seen corresponding path program 1 times [2019-09-10 08:52:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:32,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:32,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:32,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:32,802 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 08:52:32,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:32,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:32,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:32,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:32,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:32,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:32,804 INFO L87 Difference]: Start difference. First operand 148817 states and 240983 transitions. Second operand 3 states. [2019-09-10 08:52:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:35,967 INFO L93 Difference]: Finished difference Result 216937 states and 350276 transitions. [2019-09-10 08:52:35,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:35,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:52:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:36,220 INFO L225 Difference]: With dead ends: 216937 [2019-09-10 08:52:36,220 INFO L226 Difference]: Without dead ends: 216937 [2019-09-10 08:52:36,221 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 08:52:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216937 states. [2019-09-10 08:52:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216937 to 216935. [2019-09-10 08:52:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216935 states. [2019-09-10 08:52:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216935 states to 216935 states and 350275 transitions. [2019-09-10 08:52:38,285 INFO L78 Accepts]: Start accepts. Automaton has 216935 states and 350275 transitions. Word has length 138 [2019-09-10 08:52:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:38,285 INFO L475 AbstractCegarLoop]: Abstraction has 216935 states and 350275 transitions. [2019-09-10 08:52:38,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 216935 states and 350275 transitions. [2019-09-10 08:52:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:52:38,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:38,287 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, 1, 1, 1] [2019-09-10 08:52:38,288 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:38,288 INFO L82 PathProgramCache]: Analyzing trace with hash 297482555, now seen corresponding path program 1 times [2019-09-10 08:52:38,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:38,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:38,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:38,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:39,203 WARN L188 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2019-09-10 08:52:39,241 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 08:52:39,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:39,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:52:39,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:39,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:52:39,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:52:39,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:52:39,243 INFO L87 Difference]: Start difference. First operand 216935 states and 350275 transitions. Second operand 6 states. [2019-09-10 08:52:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:40,186 INFO L93 Difference]: Finished difference Result 313197 states and 505899 transitions. [2019-09-10 08:52:40,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:52:40,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 08:52:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:40,595 INFO L225 Difference]: With dead ends: 313197 [2019-09-10 08:52:40,595 INFO L226 Difference]: Without dead ends: 313197 [2019-09-10 08:52:40,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:52:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313197 states. [2019-09-10 08:52:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313197 to 247495. [2019-09-10 08:52:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247495 states. [2019-09-10 08:52:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247495 states to 247495 states and 398885 transitions. [2019-09-10 08:52:47,693 INFO L78 Accepts]: Start accepts. Automaton has 247495 states and 398885 transitions. Word has length 140 [2019-09-10 08:52:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:47,693 INFO L475 AbstractCegarLoop]: Abstraction has 247495 states and 398885 transitions. [2019-09-10 08:52:47,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:52:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 247495 states and 398885 transitions. [2019-09-10 08:52:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:52:47,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:47,695 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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:52:47,696 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash -264023695, now seen corresponding path program 1 times [2019-09-10 08:52:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:47,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:47,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:47,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:47,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:47,947 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 08:52:47,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:47,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:52:47,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:47,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:52:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:52:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:52:47,948 INFO L87 Difference]: Start difference. First operand 247495 states and 398885 transitions. Second operand 6 states. [2019-09-10 08:52:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:54,051 INFO L93 Difference]: Finished difference Result 457643 states and 737901 transitions. [2019-09-10 08:52:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:52:54,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 08:52:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:54,715 INFO L225 Difference]: With dead ends: 457643 [2019-09-10 08:52:54,715 INFO L226 Difference]: Without dead ends: 457643 [2019-09-10 08:52:54,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:52:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457643 states. [2019-09-10 08:52:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457643 to 440423. [2019-09-10 08:52:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440423 states. [2019-09-10 08:53:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440423 states to 440423 states and 709542 transitions. [2019-09-10 08:53:07,032 INFO L78 Accepts]: Start accepts. Automaton has 440423 states and 709542 transitions. Word has length 143 [2019-09-10 08:53:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:07,033 INFO L475 AbstractCegarLoop]: Abstraction has 440423 states and 709542 transitions. [2019-09-10 08:53:07,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:53:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 440423 states and 709542 transitions. [2019-09-10 08:53:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:53:07,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:07,034 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:53:07,035 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash 403290968, now seen corresponding path program 1 times [2019-09-10 08:53:07,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:07,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:07,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:07,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:07,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:07,181 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 08:53:07,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:07,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:53:07,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:07,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:53:07,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:53:07,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:07,183 INFO L87 Difference]: Start difference. First operand 440423 states and 709542 transitions. Second operand 5 states. [2019-09-10 08:53:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:09,025 INFO L93 Difference]: Finished difference Result 737111 states and 1180397 transitions. [2019-09-10 08:53:09,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:53:09,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:53:09,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:10,099 INFO L225 Difference]: With dead ends: 737111 [2019-09-10 08:53:10,099 INFO L226 Difference]: Without dead ends: 737111 [2019-09-10 08:53:10,100 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 08:53:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737111 states. [2019-09-10 08:53:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737111 to 446335. [2019-09-10 08:53:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446335 states. [2019-09-10 08:53:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446335 states to 446335 states and 715409 transitions. [2019-09-10 08:53:26,544 INFO L78 Accepts]: Start accepts. Automaton has 446335 states and 715409 transitions. Word has length 144 [2019-09-10 08:53:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:26,545 INFO L475 AbstractCegarLoop]: Abstraction has 446335 states and 715409 transitions. [2019-09-10 08:53:26,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:53:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 446335 states and 715409 transitions. [2019-09-10 08:53:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:53:26,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:26,551 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:26,551 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1108095999, now seen corresponding path program 1 times [2019-09-10 08:53:26,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:26,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:26,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:53:27,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:27,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:53:27,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:27,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:53:27,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:53:27,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:53:27,907 INFO L87 Difference]: Start difference. First operand 446335 states and 715409 transitions. Second operand 6 states. [2019-09-10 08:53:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:29,387 INFO L93 Difference]: Finished difference Result 540412 states and 867228 transitions. [2019-09-10 08:53:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:53:29,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-10 08:53:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:37,444 INFO L225 Difference]: With dead ends: 540412 [2019-09-10 08:53:37,444 INFO L226 Difference]: Without dead ends: 540412 [2019-09-10 08:53:37,445 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 08:53:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540412 states. [2019-09-10 08:53:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540412 to 498602. [2019-09-10 08:53:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498602 states. [2019-09-10 08:53:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498602 states to 498602 states and 799201 transitions. [2019-09-10 08:53:43,779 INFO L78 Accepts]: Start accepts. Automaton has 498602 states and 799201 transitions. Word has length 180 [2019-09-10 08:53:43,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:43,780 INFO L475 AbstractCegarLoop]: Abstraction has 498602 states and 799201 transitions. [2019-09-10 08:53:43,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:53:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 498602 states and 799201 transitions. [2019-09-10 08:53:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:53:43,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:43,786 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:43,786 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash -959318747, now seen corresponding path program 1 times [2019-09-10 08:53:43,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:43,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:43,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:43,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:43,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 08:53:43,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:53:43,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:43,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:53:43,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:53:43,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:53:44,000 INFO L87 Difference]: Start difference. First operand 498602 states and 799201 transitions. Second operand 6 states. [2019-09-10 08:53:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:47,329 INFO L93 Difference]: Finished difference Result 651224 states and 1046933 transitions. [2019-09-10 08:53:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:53:47,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-10 08:53:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:48,348 INFO L225 Difference]: With dead ends: 651224 [2019-09-10 08:53:48,348 INFO L226 Difference]: Without dead ends: 651224 [2019-09-10 08:53:48,349 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 08:53:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651224 states. [2019-09-10 08:54:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651224 to 489736. [2019-09-10 08:54:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489736 states. [2019-09-10 08:54:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489736 states to 489736 states and 784841 transitions. [2019-09-10 08:54:04,315 INFO L78 Accepts]: Start accepts. Automaton has 489736 states and 784841 transitions. Word has length 180 [2019-09-10 08:54:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:04,316 INFO L475 AbstractCegarLoop]: Abstraction has 489736 states and 784841 transitions. [2019-09-10 08:54:04,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:54:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 489736 states and 784841 transitions. [2019-09-10 08:54:04,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:54:04,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:04,321 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:04,321 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:04,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash 662502449, now seen corresponding path program 1 times [2019-09-10 08:54:04,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:04,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:04,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:04,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:54:04,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:54:04,521 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2019-09-10 08:54:04,524 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], [252], [255], [258], [261], [263], [303], [306], [311], [333], [336], [339], [341], [343], [383], [423], [426], [429], [432], [435], [438], [445], [453], [455], [458], [459], [461], [470], [473], [484], [487], [499], [519], [522], [568], [578], [588], [598], [620], [623], [669], [679], [689], [699], [709], [713], [717], [719], [721], [724], [770], [780], [790], [800], [822], [825], [871], [881], [891], [901], [1529], [1530], [1534], [1535], [1536] [2019-09-10 08:54:04,591 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:54:04,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:54:04,813 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:54:05,169 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:54:05,172 INFO L272 AbstractInterpreter]: Visited 155 different actions 265 times. Merged at 52 different actions 105 times. Never widened. Performed 1056 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1056 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 294 variables. [2019-09-10 08:54:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:05,176 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:54:05,816 INFO L227 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 89.58% of their original sizes. [2019-09-10 08:54:05,817 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:54:38,889 INFO L420 sIntCurrentIteration]: We unified 179 AI predicates to 179 [2019-09-10 08:54:38,890 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:54:38,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:54:38,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [101] imperfect sequences [5] total 104 [2019-09-10 08:54:38,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:38,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-10 08:54:38,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-10 08:54:38,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=8478, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 08:54:38,896 INFO L87 Difference]: Start difference. First operand 489736 states and 784841 transitions. Second operand 101 states.